The following pages link to (Q4038720):
Displayed 9 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 matchings in planar graphs via Gaussian elimination (Q2369872) (← links)
- Processor efficient parallel matching (Q2471700) (← 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)