Pages that link to "Item:Q4229410"
From MaRDI portal
The following pages link to Bipartite Edge Coloring in $O(\Delta m)$ Time (Q4229410):
Displaying 26 items.
- A complexity analysis and an algorithmic approach to student sectioning in existing timetables (Q310342) (← links)
- Subset matching and edge coloring in bipartite graphs (Q510962) (← links)
- Computing large matchings in planar graphs with fixed minimum degree (Q553342) (← links)
- Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks (Q841605) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Edge-coloring bipartite multigraphs in \(O(E \log D)\) time (Q873646) (← links)
- A simple algorithm for edge-coloring bipartite multigraphs (Q1007547) (← links)
- Three-dimensional orthogonal graph drawing algorithms (Q1570822) (← links)
- Routing and path multicoloring (Q1607124) (← links)
- Space-efficient Euler partition and bipartite edge coloring (Q1628587) (← links)
- A simple matching algorithm for regular bipartite graphs. (Q1853135) (← links)
- Gridline graphs: A review in two dimensions and an extension to higher dimensions (Q1861575) (← links)
- Tight bounds on maximal and maximum matchings (Q1877645) (← links)
- Approximate constrained bipartite edge coloring (Q1887041) (← links)
- Reconfiguration of list \(L(2,1)\)-labelings in a graph (Q2250462) (← links)
- Distributed edge coloration for bipartite networks (Q2377126) (← links)
- Latin squares with bounded size of row prefix intersections (Q2492205) (← links)
- Using the minimum maximum flow degree to approximate the flow coloring problem (Q2675725) (← links)
- On the complexity of computing the excessive \([B]\)-index of a graph (Q2811195) (← links)
- From L. Euler to D. König (Q3398587) (← links)
- Edge Bipartization Faster Than 2^k (Q4634410) (← links)
- (Q4940090) (← links)
- Space-Efficient Euler Partition and Bipartite Edge Coloring (Q5283378) (← links)
- Edge coloring of bipartite graphs with constraints (Q5958313) (← links)
- Arbitrary-size permutation networks using arbitrary-radix switches (Q6159027) (← links)
- Computing maximum matchings in temporal graphs (Q6168321) (← links)
