Analysis of approximate algorithms for edge-coloring bipartite graphs (Q673614): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(95)00013-3
+Normal rank
@@ Property / OpenAlex ID @@
+W1973917240
@@ Property / OpenAlex ID: W1973917240 / rank @@
+Normal rank
@@ Property / cites work @@
+The greedy algorithm is optimal for on-line edge coloring
+Normal rank
@@ Property / cites work @@
+Q4099676
@@ Property / cites work: Q4099676 / rank @@
+Normal rank
@@ Property / cites work @@
+A better than “best possible” algorithm to edge color multigraphs
+Normal rank
@@ Property / cites work @@
+Scheduling parallel I/O operations in multiple bus systems
+Normal rank
@@ Property / cites work @@
+Analysis of approximate algorithms for edge-coloring bipartite graphs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:673614