The following pages link to (Q3686754):
Displaying 13 items.
- How to use the minimal separators of a graph for its chordal triangulation (Q4645172) (← links)
- Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph (Q4909563) (← links)
- Optimal pricing of capacitated networks (Q5191131) (← links)
- A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs (Q5301387) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710821) (← links)
- Algorithms and Computation (Q5897943) (← links)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)
- Recognizing \(k\)-clique extendible orderings (Q5925536) (← links)
- Nesting of prime substructures in \(k-\)ary relations (Q5941284) (← links)
- Preemptive hybrid flowshop scheduling problem of interval orders (Q5956203) (← links)
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q6167020) (← links)
- Tree-width and path-width of comparability graphs of interval orders (Q6184354) (← links)
- Gallai-like characterization of strong cocomparability graphs (Q6595514) (← links)
