Items where Subject is "05-XX Combinatorics > 05Cxx Graph theory"
![]() | Up a level |
- MSC Classification Numbers (191)
- 05-XX Combinatorics (191)
- 05Cxx Graph theory (191)
- 05C05 Trees (17)
- 05C40 Connectivity (10)
- 05Cxx Graph theory (191)
- 05-XX Combinatorics (191)
Article
Liers, Frauke and Pardella, Gregor
(2011)
Simplifying Maximum Flow Computations: the Effect of Shrinking and Good Initial Flows.
Published in:
Discrete Applied Mathematics Vol. 159 (17).
2187 -2203.
Mallach, Sven
(2018)
Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem.
Published in:
Journal of Discrete Algorithms.
Proceedings article
Faigle, Ulrich and Schrader, Rainer
(1985)
Comparability graphs and order invariants.
Published In:
Proceedings of the WG'84 ; Graphtheoretic concepts in computer science Trauner Verlag 1985, pp. 136-145.
Faigle, Ulrich and Schrader, Rainer
(1985)
Minimization techniques for comparability graphs.
Published In:
Proceedings of the WG'84 ; Graphtheoretic concepts in computer science Trauner Verlag 1985, pp. 101-122.
Mallach, Sven
(2017)
Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem.
Published In:
Combinatorial Algorithms : 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers, Lecture Notes in Computer Science. 10765 Springer 2017, pp. 327-340.
Paper
Mallach, Sven
(2015)
A practical mixed-integer programming model for
the vertex separation number problem.
Working Paper
, 8 p.