Packing cycles exactly in polynomial time (Q421271): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q403432
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-010-9347-1 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-010-9347-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057309492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for Feedback Vertex Sets in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles in graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Circuits Contained in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms and hardness results for cycle packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Matchings and 2-covers of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Cycles: Integrality Gap, Hardness, and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-010-9347-1 / rank
 
Normal rank

Latest revision as of 17:04, 9 December 2024

scientific article
Language Label Description Also known as
English
Packing cycles exactly in polynomial time
scientific article

    Statements

    Packing cycles exactly in polynomial time (English)
    0 references
    0 references
    0 references
    23 May 2012
    0 references
    packing and covering
    0 references
    polynomial algorithm
    0 references
    min-max relation
    0 references
    maximum cycle packing
    0 references

    Identifiers