A simple algorithm for edge-coloring bipartite multigraphs (Q1007547): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: On Edge Coloring Bipartite Graphs / 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: Using euler partitions to edge color bipartite multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple matching algorithm for regular bipartite graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite Edge Coloring in $O(\Delta m)$ Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization. Polyhedra and efficiency. CD-ROM / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(02)00446-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008217702 / rank
 
Normal rank

Latest revision as of 10:24, 30 July 2024

scientific article
Language Label Description Also known as
English
A simple algorithm for edge-coloring bipartite multigraphs
scientific article

    Statements