scientific article; zbMATH DE number 1139976
From MaRDI portal
Publication:4385084
Recommendations
Cited in
(53)- Normal convergence problem? Two moments and a recurrence may be the clues
- Erratum to: ``Greedy matching: guarantees and limitations
- Counting connected graphs inside-out
- Asymptotic enumeration of sparse graphs with a minimum degree constraint
- A scaling limit for the length of the longest cycle in a sparse random graph
- Matching algorithms are fast in sparse random graphs
- Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs
- Counting strongly-connected, moderately sparse directed graphs
- On the number of circuits in random graphs
- The mixing time of the giant component of a random graph
- On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three
- Karp-Sipser on random graphs with a fixed degree sequence
- Maximum matchings in random bipartite graphs and the space utilization of cuckoo hash tables
- An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three
- Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method
- Invariant probability measures and dynamics of exponential linear type maps
- Greedy Local Search and Vertex Cover in Sparse Random Graphs
- Matchings on infinite graphs
- Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
- scientific article; zbMATH DE number 6960780 (Why is no real title available?)
- Two faces of greedy leaf removal procedure on graphs
- Greedy matching: guarantees and limitations
- Understanding the correlation gap for matchings
- Birth of a giant \((k_{1},k_{2})\)-core in the random digraph
- The spread of fire on a random multigraph
- Random graphs with a fixed maximum degree
- Minors of a random binary matroid
- The number of matchings in random graphs
- STACS 2004
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- The satisfiability threshold for k-XORSAT
- Power balance and apportionment algorithms for the United States Congress
- Between 2- and 3-colorability
- Existence of absolutely continuous spectrum for Galton-Watson random trees
- Finding maximum matchings in random regular graphs in linear expected time
- Large deviations of the greedy independent set algorithm on sparse random graphs
- A local algorithm and its percolation analysis of bipartite z-matching problem
- A scaling limit for the length of the longest cycle in a sparse random digraph
- A probabilistic algorithm for vertex cover
- On the rank, kernel, and core of sparse random graphs
- How many random edges make an almost-Dirac graph Hamiltonian?
- Matching algorithms in the sparse stochastic block model
- The average performance of the greedy matching algorithm
- Online matching for the multiclass stochastic block model
- Hamilton cycles in random digraphs with minimum degree at least one
- The critical Karp-Sipser core of random graphs
- A central limit theorem for the matching number of a sparse random graph
- The rank of sparse symmetric matrices over arbitrary fields
- Asymptotic optimality of degree-greedy discovering of independent sets in configuration model graphs
- A new impossibility result for online bipartite matching problems
- Distributed algorithms for random graphs
- Edge percolation on a random regular graph of low degree
- Finite size scaling for the core of large random hypergraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385084)
