„split graphs“

Suchergebnisse

1.000+ Treffer

• Fully discrete semi-implicit second order splitting for anisotropic surface diffusion of graphs
  Deckelnick, Klaus ; Dziuk, Gerhard ; Elliott, Charles 2003 Math. Inst.
• Locating-Dominating Sets in Some Subclasses of Split Graphs
  Belo, Pedro Augusto Serafim ; Santana, Márcia Rodrigues Cappelle
• Fully discrete semi-implicit second order splitting for anisotropic surface diffusion of graphs
  Deckelnick, Klaus ; Dziuk, Gerhard ; Elliott, Charles 2003 Univ., Fak. für Mathematik
• Domination and its variants in split graphs -P versus NPC dichotomy
  Mohanapriya, A. ; Renjith, P. ; Sadagopan, N.
• Parameterized Dynamic Data Structure for Split Completion
  Majewski, Konrad ; Pilipczuk, Michał ; Zych-Pawlewicz, Anna 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On 2-Factors Splitting an Embedded Graph into Two Plane Graphs
  Brinkmann, Gunnar ; Chiers, Sara ; Zamfirescu, Carol T.
• Graph-Theoretic Concepts in Computer Science – 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers
  Kolman, Petr ; Kratochvíl, Jan 2011 Springer Berlin Heidelberg
• Approximating Maximum Cut on Interval Graphs and Split Graphs Beyond Goemans-Williamson
  Ahn, Jungho ; DeHaan, Ian ; Kim, Eun Jung ; Lee, Euiwoong 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The join of split graphs whose completely regular endomorphisms form a monoid
  Hou, Hailong ; Song, Yanhua ; Gu, Rui
• The Generalised Colouring Numbers on Classes of Bounded Expansion
  Kreutzer, Stephan ; Pilipczuk, Michal ; Rabinovich, Roman ; Siebertz, Sebastian 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On $$\alpha $$ α -Split Domination in Graphs
  Amutha, S. ; Prabha, K. Suriya ; Anbazhagan, Neelamegam ; Gomathi, S. Sankara ; Cangul, Ismail Naci
• Vertex Deletion Problems on Chordal Graphs
  Cao, Yixin ; Ke, Yuping ; Otachi, Yota ; You, Jie 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs
  Kreutzer, Stephan ; Rabinovich, Roman ; Siebertz, Sebastian ; Weberstädt, Grischa 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On minimum t-claw deletion in split graphs
  Mishra, Sounaka
• Split-Merge Processes on Graphs and Matrices
  Roth, Lukas ; Betz, Volker ; Aurzada, Frank 2025 Universitäts- und Landesbibliothek
• When Can Cluster Deletion with Bounded Weights Be Solved Efficiently?
  Garvardt, Jaroslav ; Komusiewicz, Christian ; Morawietz, Nils 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Covering and Partitioning of Split, Chain and Cographs with Isometric Paths
  Chakraborty, Dibyayan ; Müller, Haiko ; Ordyniak, Sebastian ; Panolan, Fahad ; Rychlicki, Mateusz 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Breaking the Barrier 2^k for Subset Feedback Vertex Set in Chordal Graphs
  Bai, Tian ; Xiao, Mingyu 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Extending Partial Representations of Circle Graphs in Near-Linear Time
  Brückner, Guido ; Rutter, Ignaz ; Stumpf, Peter 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Kernels for Edge Modification Problems
  Cao, Yixin ; Ke, Yuping 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik