Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems (Q2971609): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4251057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time approximation algorithm for weighted matchings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of the Greedy Heuristic for Independence Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced network flows. VIII. A revised theory of phase‐ordered algorithms and the <i>O</i>( $\bf\it\sqrt{n}m$ log(<i>n</i><sup>2</sup>/<i>m</i>)/log <i>n</i>) bound for the nonbipartite cardinality matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of <i>O</i> ( <i>nm</i> log <i>n</i> ) weighted matchings in general graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for two bottleneck optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Minimum-Weight Perfect Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another look at the degree constrained subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster scaling algorithms for general graph matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching algorithms are fast in sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case analysis of algorithms for matchings and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating matchings in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique partitions, graph compression and speeding-up algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Kuhn's Hungarian Method?A tribute from Hungary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the number of unused colors in the vertex coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum network flow with floating point arithmetic. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple approximation algorithm for the weighted matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum skew-symmetric flows and matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4426349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy in Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating optimum branchings in linear time / rank
 
Normal rank

Latest revision as of 16:20, 13 July 2024

scientific article
Language Label Description Also known as
English
Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems
scientific article

    Statements

    Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems (English)
    0 references
    0 references
    7 April 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references