„vertex separator“

Suchergebnisse

20 Treffer

• Some results on connected vertex separators
  Kumar, R. Mahendra ; Sadagopan, N.
• The multi-terminal vertex separator problem: total dual integrality and polytope composition
  Magnouche, Y. ; Mahjoub, Ali Ridha ; Martin, S.
• All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs
  Anand, Aditya ; Lee, Euiwoong ; Li, Jason ; Saranurak, Thatchaphol 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Finding Secluded Places of Special Interest in Graphs
  Van Bevern, René ; Fluschnik, Till ; Mertzios, George B. ; Molter, Hendrik ; Sorge, Manuel ; Suchý, Ondrej 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithms for the Maximum Independent Set Problem
  Lê, Ngoc C. ; Schiermeyer, Ingo ; Harant, Jochen 2015 Technische Universitaet Bergakademie Freiberg Universitaetsbibliothek "Georgius Agricola"
• Multi-Budgeted Directed Cuts
  Kratsch, Stefan ; Li, Shaohua ; Marx, Dániel ; Pilipczuk, Marcin ; Wahlström, Magnus 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Separator Based Data Reduction for the Maximum Cut Problem
  Charfreitag, Jonas ; Dahn, Christine ; Kaibel, Michael ; Mayer, Philip ; Mutzel, Petra ; Schürmann, Lukas 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Temporal Separators with Deadlines
  Harutyunyan, Hovhannes A. ; Koupayi, Kamran ; Pankratov, Denis 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• PACE Solver Description: tdULL
  Brokkelkamp, Ruben ; van Venetië, Raymond ; de Vries, Mees ; Westerdiep, Jan 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Treewidth of Hanoi Graphs
  Eppstein, David ; Frishberg, Daniel ; Maxwell, William 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut
  Manurangsi, Pasin ; Trevisan, Luca 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• α-Vertex separator is NP-hard even for 3-regular graphs
  Müller, R. ; Wagner, D.
• Effective lower bounds for crossing number, bisection width and balanced vertex separator in terms of symmetry
  Shahrokhi, Farhad ; Székely, László A. 1992 Sonderforschungsbereich 303
• The vertex separator problem: algorithms and computations
  Souza, Cid de ; Balas, Egon
• Separators in Graphs with Negative and Multiple Vertex Weights
  Djidjev, H. N. ; Gilbert, J. R.
• Space-Efficient Vertex Separators for Treewidth
  Kammer, Frank ; Meintrup, Johannes ; Sajenko, Andrej
• The vertex separator problem: a polyhedral investigation
  Balas, Egon ; Souza, Cid C. de
• Approximating Small Balanced Vertex Separators in Almost Linear Time
  Brandt, Sebastian ; Wattenhofer, Roger
• A multilevel bilinear programming algorithm for the vertex separator problem
  Hager, William W. ; Hungerford, James T. ; Safro, Ilya
• The min-cut and vertex separator problem
  Rendl, Fanz ; Sotirov, Renata