„split graphs“

Suchergebnisse

69 Treffer

• (Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes
  Bathie, Gabriel ; Bousquet, Nicolas ; Pierron, Théo 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths
  Curticapean, Radu ; Dell, Holger ; Husfeldt, Thore 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Quick Separation in Chordal and Split Graphs
  Misra, Pranabendu ; Panolan, Fahad ; Rai, Ashutosh ; Saurabh, Saket ; Sharma, Roohani 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Alignment- and Reference-Free Phylogenomics with Colored de Bruijn Graphs
  Wittler, Roland 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Cluster Deletion on Interval Graphs and Split Related Graphs
  Konstantinidis, Athanasios L. ; Papadopoulos, Charis 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Enumerating Minimal Dominating Sets in Triangle-Free Graphs
  Bonamy, Marthe ; Defrain, Oscar ; Heinrich, Marc ; Raymond, Jean-Florent 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Token Sliding on Split Graphs
  Belmonte, Rémy ; Kim, Eun Jung ; Lampis, Michael ; Mitsou, Valia ; Otachi, Yota ; Sikora, Florian 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The b-Matching Problem in Distance-Hereditary Graphs and Beyond
  Ducoffe, Guillaume ; Popa, Alexandru 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Dual Parameterization of Weighted Coloring
  Araújo, Júlio ; Campos, Victor A. ; Lima, Carlos Vinícius G. C. ; Santos, Vinicius ˜dosœ ; Sau, Ignasi ; Silva, Ana 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Splittings of toric ideals of graphs
  Katsabekis, Anargyros ; Thoma, Apostolos
• Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs
  Konstantinidis, Athanasios L. ; Papadopoulos, Charis 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs
  Kanj, Iyad ; Komusiewicz, Christian ; Sorge, Manuel ; Jan van Leeuwen, Erik 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces
  Bonsma, Paul 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Recognition of Tolerance and Bounded Tolerance Graphs
  Mertzios, George B. ; Sau, Ignasi ; Zaks, Shmuel 2010 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Configurations from a Graphical Viewpoint
  Pisanski, Tomaž ; Servatius, Brigitte 2013 Birkhäuser Boston
• On the Planar Split Thickness of Graphs
  Eppstein, David ; Kindermann, Philipp ; Kobourov, Stephen ; Liotta, Giuseppe ; Lubiw, Anna ; Maignan, Aude ; Mondal, Debajyoti ; Vosoughpour, Hamideh ; Whitesides, Sue ; Wismath, Stephen
• A nuclear ribosomal DNA phylogeny of Acer inferred with maximum likelihood, splits graphs, and motif analysis of 606 sequences
  Grimm, Guido W. ; Renner, Susanne S. ; Stamatakis, Alexandros ; Hemleben, Vera
• Scheduling on a Batch Processing Machine with Split Compatibility Graphs
  Boudhar, Mourad
• Dynamic Scheduling on a Single Batch Processing Machine with Split Compatibility Graphs
  Boudhar, Mourad
• The h-faulty-block connectivity of alternating group graphs and split-star networks
  Hua, Xiaohui ; Zhao, Qin