Items where Subject is "05-XX Combinatorics > 05Cxx Graph theory > 05C05 Trees"
![]() | Up a level |
- MSC Classification Numbers (17)
- 05-XX Combinatorics (17)
- 05Cxx Graph theory (17)
- 05C05 Trees (17)
- 05Cxx Graph theory (17)
- 05-XX Combinatorics (17)
A
Andres, Dominique (2003) Spieltheoretische Kantenfärbungsprobleme auf Wäldern und verwandte Strukturen. Masters thesis.
B
Bachem, Achim and Hamacher, Anja and Moll, Christoph and Raspel, Guido
(1997)
Optimale Linienführung und Routenplanung in Verkehrssystemen.
Published in:
Mathematik : Schlüsseltechnologie für die Zukunft ; Verbundprojekte zwischen Universität und Industrie. Springer 1997, pp. 626-636.
Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian
(2006)
Drawing Rooted Trees in Linear Time.
Published in:
Software; Practice and Experience Vol. 36 (6).
pp. 651-665.
Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian
(2002)
Improving Walker's Algorithm to Run in Linear Time.
Published In:
Graph drawing : 10th international symposium, GD 2002, Irvine, CA, USA, August 26 - 28, 2002 ; revised papers, Lecture notes in computer science. 2528 Springer 2002, pp. 347-364.
F
Faigle, Ulrich and Schrader, Rainer
(1986)
Greene-Kleitman extension of ordered sets.
Published in:
Methods of Operations Research Vol. 53.
251-255 .
Fekete, Sandor P. and Khuller, Samir and Klemmstein, Monika and Raghavachari, Balaji and Young, Neal
(1996)
A network-flow technique for finding low-weight bounded-degree spanning trees.
Published In:
Integer programming and combinatorial optimization : 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3 - 5, 1996 ; proceedings, Lecture notes in computer science. 1084 Springer 1996, pp. 105-117.
Fekete, Sandor P. and Khuller, Samir and Klemmstein, Monika and Raghavachari, Balaji and Young, Neal
(1997)
A network-flow technique for finding low-weight bounded-degree spanning trees.
Published in:
Journal of Algorithms Vol. 24 (2).
pp. 310-324.
Fekete, Sandor P. and Klemmstein, Monika
(1995)
Worst-case ratios for degree-constrained trees.
Published In:
Proceedings of the 4th Biannual Twente Workshop on Graph Theory and Discrete Optimization 1995, pp. 103-106.
Fekete, Sandor P. and Kremer, Jana
(1998)
Tree Spanners in Planar Graphs.
Published In:
Graph theoretic concepts in computer science : 24th international workshop ; proceedings / WG '98, Smolenice Castle, Slovak Republic, June 18 - 20, 1998 , Lecture notes in computer science. 1517 Springer 1998, pp. 9-30.
Fekete, Sandor P. and Kremer, Jana
(2001)
Tree Spanners in Planar Graphs.
Published in:
Discrete Applied Mathematics Vol. 108 (1-2).
pp. 85-103.
H
Hamacher, Anja (1997) Baumzerlegungen unter Nebenbedingungen -- Ein Clusterverfahren zur Lösung praktischer Vehicle-Routing-Probleme. PhD thesis.
Hamacher, Anja and Hochstättler, Winfried and Moll, Christoph
(2000)
Tree Partitioning under Constraints -- Clustering for Vehicle Routing Problems.
Published in:
Discrete Applied Mathematics Vol. 99 (1-3).
pp. 55-69.
Hamacher, Anja and Moll, Christoph
(1997)
A New Heuristic for Vehicle Routing with Narrow Time Windows.
Published In:
Selected papers of the Symposium on Operations Research (SOR) : Braunschweig, September 3 - 6, 1996 Springer 1997, pp. 301-306.
K
Korte, Bernhard and Schrader, Rainer
(1981)
A survey on oracle techniques.
Published In:
Mathematical Foundations of Computer Science ; Proceedings, 10th Symposium Štrbské Pleso, Czechoslovakia August 31 – September 4, 1981, Lecture Notes in Computer Science. 118 Springer 1981, pp. 61-77.
L
Leclerc, Matthias and Rendl, Franz
(1989)
Constrained Spanning Trees and the Travelling Salesman Problem.
Published in:
European journal of operational research Vol. 39 (1).
pp. 96-102.
M
Mallach, Sven
(2011)
On separation pairs and split components of biconnected graphs.
Technical Report
, 16 p.
S
Schrader, Rainer
(1983)
Approximations to partitioning and subgraph problems on trees.
Published in:
Discrete Applied Mathematics Vol. 6 (3).
pp. 301-309.