Pages that link to "Item:Q3527209"
From MaRDI portal
The following pages link to Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover (Q3527209):
Displaying 5 items.
- Subset matching and edge coloring in bipartite graphs (Q510962) (← links)
- Approximating edge dominating set in dense graphs (Q764308) (← links)
- Equistable simplicial, very well-covered, and line graphs (Q2448905) (← links)
- (Q3002808) (← links)
- Approximating Edge Dominating Set in Dense Graphs (Q3010383) (← links)