Pages that link to "Item:Q2746432"
From MaRDI portal
The following pages link to Unique Maximum Matching Algorithms (Q2746432):
Displayed 11 items.
- Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs (Q328720) (← links)
- Maximum matchings in scale-free networks with identical degree distribution (Q528496) (← links)
- Computing large matchings in planar graphs with fixed minimum degree (Q553342) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Are unique subgraphs not easier to find? (Q1707980) (← links)
- On some graphs with a unique perfect matching (Q1799576) (← links)
- On the König deficiency of zero-reducible graphs (Q2292142) (← links)
- Unique subgraphs are not easier to find (Q2855752) (← links)
- VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS (Q3087098) (← links)
- (Q4993356) (← links)
- Contracting a Planar Graph Efficiently (Q5111739) (← links)