The following pages link to (Q4038720):
Displaying 20 items.
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Path factors and parallel knock-out schemes of almost claw-free graphs (Q968408) (← links)
- Storage controlled pile-up systems, theoretical foundations (Q1280184) (← links)
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm (Q1323480) (← links)
- Maximum matching in regular and almost regular graphs (Q1949755) (← links)
- The power of linear-time data reduction for maximum matching (Q2211355) (← links)
- Maximum matchings in planar graphs via Gaussian elimination (Q2369872) (← links)
- Processor efficient parallel matching (Q2471700) (← links)
- An extension of Hall's theorem for partitioned bipartite graphs (Q2630339) (← links)
- Optimal extension protocols for Byzantine broadcast and agreement (Q2657277) (← links)
- Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems (Q2971609) (← links)
- On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (Q3304140) (← links)
- (Q5091230) (← links)
- The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)
- On the anti-Kekulé problem of cubic graphs (Q5198031) (← links)
- (Q5743485) (← links)
- Tractable minor-free generalization of planar zero-field Ising models (Q5857455) (← links)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)
- Illumination in the presence of opaque line segments in the plane (Q5959562) (← links)
