Items where Subject is "05-XX Combinatorics > 05Cxx Graph theory"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items at this level: 5.

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.

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 (2015) A practical mixed-integer programming model for the vertex separation number problem.
Working Paper , 8 p.

Mallach, Sven (2017) Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem.
To appear In: Proceedings 28th International Workshop On Combinatorial Algorithms (IWOCA), Lecture Notes in Computer Science. Springer 2017.

This list was generated on Sat Aug 19 04:02:42 2017 CEST.