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

@@ Property / Wikidata QID @@
+Q56390588
@@ Property / Wikidata QID: Q56390588 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On Edge Coloring Bipartite Graphs
@@ Property / cites work: On Edge Coloring Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
+Normal rank
@@ Property / cites work @@
+Using euler partitions to edge color bipartite multigraphs
+Normal rank
@@ Property / cites work @@
+A simple matching algorithm for regular bipartite graphs.
+Normal rank
@@ Property / cites work @@
+Bipartite Edge Coloring in $O(\Delta m)$ Time
@@ Property / cites work: Bipartite Edge Coloring in $O(\Delta m)$ Time / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(02)00446-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2008217702
@@ Property / OpenAlex ID: W2008217702 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1007547