„Graph Packing“

Suchergebnisse

142 Treffer

• Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs
  Ahmadian, Sara ; Friggstad, Zachary 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fast Parallel Fixed-parameter Algorithms via Color Coding
  Bannach, Max ; Stockhusen, Christoph ; Tantau, Till 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Geometry and Topology of Crystals: From Sphere-Packing to Tiling, Nets, and Knots (Invited Talk)
  Robins, Vanessa 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity
  Yamaguchi, Yutaro 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Planar Tree Packing Theorem
  Geyer, Markus ; Hoffmann, Michael ; Kaufmann, Michael ; Kusters, Vincent ; Tóth, Csaba 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Strongly Monotone Drawings of Planar Graphs
  Felsner, Stefan ; Igamberdiev, Alexander ; Kindermann, Philipp ; Klemz, Boris ; Mchedlidze, Tamara ; Scheucher, Manfred 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On Weighted Bipartite Edge Coloring
  Khan, Arindam ; Singh, Mohit 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Graph coloring, communication complexity and the stubborn problem (Invited Talk)
  Bousquet, Nicolas ; Lagoutte, Aurélie ; Stéphan, Thomassé 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Edge-disjoint Odd Cycles in 4-edge-connected Graphs
  Kawarabayashi, Ken-ichi ; Kobayashi, Yusuke 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs
  Babenko, Maxim ; Gusakov, Alexey 2011 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Directed cut transversal packing for source-sink connected graphs
  Feofiloff, P. ; Younger, D. H.
• Packing and Covering Triangles in Bilaterally-Complete Tripartite Graphs
  Amarnani, Naivedya ; De Burgos, A. ; Broughton, Wayne
• An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs
  Chen, Xujin ; Zang, Wenan
• Growth of random plane graphs and packings
  Zhuravlev, V. G. ; Maleev, A. V. ; Rau, V. G. ; Shutov, A. V.
• Deformation Characteristics of Gland Packings Made of Heat-Expanded Graphite
  Avdeev, V. V. ; Il'in, E. T. ; Ionov, S. G. ; Bozhko, G. V. ; Gusak, O. V. ; Prodan, V. D.
• A note on packing paths in planar graphs
  Frank, András ; Szigeti, Zoltán
• Clique r-domination and clique r-packing problems on dually chordal graphs
  Brandstädt, Andreas ; Chepoi, Victor D. ; Dragan, Feodor F. 1994 UD, Fachbereich Mathematik
• Simple algorithms for disjoint Steiner trees and paths packing problems in planar graphs
  Wagner, Dorothea 1993 TU, Fachbereich 3
• Non crossing path packings in planar graphs with applications
  Weihe, Karsten 1993 TU, Fachbereich 3
• Independent packings in structured graphs
  Cameron, Kathie ; Hell, Pavol