Arrow Research search
Back to FOCS

FOCS 1981

Maximum Matchings in Sparse Random Graphs

Conference Paper Session 6 Algorithms and Complexity ยท Theoretical Computer Science

Abstract

No abstract is available in the live database for this paper.

Authors

Keywords

  • Heuristic algorithms
  • Algorithm design and analysis
  • Space technology
  • Laboratories
  • Computer science
  • Mathematics
  • Stochastic processes
  • Data structures
  • Testing
  • Random Graph
  • Perfect Match
  • Random Variables
  • Markov Chain
  • Poisson Distribution
  • Fixed Point
  • L-arginine
  • Positive Constant
  • Sample Space
  • Heuristic Algorithm
  • Even Number
  • Phase Behavior
  • Random Tree
  • Probability 1
  • Vertex Degree
  • Algorithm Execution
  • Maximum Matching
  • Sparse Graph
  • Graph Matching
  • Markovian Jump

Context

Venue
IEEE Symposium on Foundations of Computer Science
Archive span
1975-2025
Indexed papers
3809
Paper id
891042508093923922
v2026.09.13