TRIANGLE-FREE 2-MATCHINGS REVISITED (Q3084696): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-coloring bipartite multigraphs in \(O(E \log D)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect triangle-free 2-matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem / 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: Q5518320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank

Latest revision as of 22:25, 3 July 2024

scientific article
Language Label Description Also known as
English
TRIANGLE-FREE 2-MATCHINGS REVISITED
scientific article

    Statements

    Identifiers