„Graph Algorithms“

Suchergebnisse

3.156 Treffer

• The Maximum Label Propagation Algorithm on Sparse Random Graphs
  Knierim, Charlotte ; Lengler, Johannes ; Pfister, Pascal ; Schaller, Ulysse ; Steger, Angelika 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
  Misra, Pranabendu ; Saurabh, Saket ; Sharma, Roohani ; Zehavi, Meirav 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Distributed Degree Splitting and Edge Coloring
  Ghaffari, Mohsen ; Hirvonen, Juho ; Kuhn, Fabian ; Maus, Yannic ; Suomela, Jukka ; Uitto, Jara 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Contracting a Planar Graph Efficiently
  Holm, Jacob ; Italiano, Giuseppe F. ; Karczmarz, Adam ; Lacki, Jakub ; Rotenberg, Eva ; Sankowski, Piotr 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Sublinear Random Access Generators for Preferential Attachment Graphs
  Even, Guy ; Levi, Reut ; Medina, Moti ; Rosén, Adi 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
  Dorn, Frederic ; Fomin, Fedor V. ; Lokshtanov, Daniel ; Raman, Venkatesh ; Saurabh, Saket 2010 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391)
  Král’, Daniel ; Pilipczuk, Michał ; Siebertz, Sebastian ; Sullivan, Blair D.
• Component Order Connectivity in Directed Graphs
  Bang-Jensen, Jørgen ; Eiben, Eduard ; Gutin, Gregory Z. ; Wahlström, Magnus ; Yeo, Anders
• (Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes
  Bathie, Gabriel ; Bousquet, Nicolas ; Cao, Yixin ; Ke, Yuping ; Pierron, Théo
• Computing median and antimedian sets in median graphs
  Balakrishnan, Kannan ; Brešar, Boštjan ; Changat, Manoj ; Klavžar, Sandi ; Kovše, Matjaž ; Subhamathi, Ajitha R.
• Binary Search in Graphs Revisited
  Deligkas, Argyrios ; Mertzios, George B. ; Spirakis, Paul G.
• Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees
  Afshar, Ramtin ; Goodrich, Michael T. ; Ozel, Evrim 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Pre-Coloring Extension and List Coloring Problems
  Gutin, Gregory Z. ; Majumdar, Diptapriyo ; Ordyniak, Sebastian ; Wahlström, Magnus 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs
  Xiao, Mingyu ; Huang, Sen ; Chen, Xiaoyu
• Inserting an Edge into a Planar Graph
  Gutwenger, Carsten ; Mutzel, Petra ; Weiskircher, René
• Compression of Dynamic Graphs Generated by a Duplication Model
  Turowski, Krzysztof ; Magner, Abram ; Szpankowski, Wojciech
• Transactions on Computational Science XXIX
  Gavrilova, Marina L. ; Tan, C. J. Kenneth 2017 Springer Berlin Heidelberg
• Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs
  Chakraborty, Dibyayan ; Das, Sandip ; Foucaud, Florent ; Gahlawat, Harmender ; Lajou, Dimitri ; Roy, Bodhayan 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Parameterized Complexity View on Collapsing k-Cores
  Luo, Junjie ; Molter, Hendrik ; Suchý, Ondrej 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Expanding Search Ratio of a Graph
  Angelopoulos, Spyros ; Dürr, Christoph ; Lidbetter, Thomas 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik