- Record: found
- Abstract: not found
- Article: not found
Link scheduling in polynomial time
Read this article at
ScienceOpenPublisher
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Abstract
Related collections
Most cited references10
- Record: found
- Abstract: not found
- Article: not found
The ellipsoid method and its consequences in combinatorial optimization
M. Grötschel, L Lovász, A Schrijver (1981)
- Record: found
- Abstract: not found
- Article: not found
Maximum matching and a polyhedron with 0,1-vertices
Jack Edmonds (1965)
- Record: found
- Abstract: not found
- Article: not found
The NP-Completeness of Edge-Coloring
Ian Holyer (1981)