„Graph Algorithms“

Suchergebnisse

3.156 Treffer

• Theoretical computer science – 8th IFIP TC 1 WG 2.2 international conference ; proceedings
  Díaz, Josep ; Lanese, Ivan ; Sangiorgi, Davide 2014 Springer
• Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases
  Lauria, Massimo ; Nordström, Jakob 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• LP can be a cure for Parameterized Problems
  Narayanaswamy, N.S. ; Raman, Venkatesh ; Ramanujan, M.S. ; Saurabh, Saket 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Linear-Time Recognition of Double-Threshold Graphs
  Kobayashi, Yusuke ; Okamoto, Yoshio ; Otachi, Yota ; Uno, Yushi
• Multi-Level Weighted Additive Spanners
  Ahmed, Reyan ; Bodwin, Greg ; Sahneh, Faryad Darabi ; Hamm, Keaton ; Kobourov, Stephen ; Spence, Richard 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Packing Directed Circuits Quarter-Integrally
  Masařík, Tomáš ; Muzi, Irene ; Pilipczuk, Marcin ; Rzążewski, Paweł ; Sorge, Manuel 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
  Korenwein, Viatcheslav ; Nichterlein, André ; Niedermeier, Rolf ; Zschoche, Philipp 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
  van der Grinten, Alexander ; Bergamini, Elisabetta ; Green, Oded ; Bader, David A. ; Meyerhenke, Henning 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Finding Detours is Fixed-Parameter Tractable
  Bezáková, Ivona ; Curticapean, Radu ; Dell, Holger ; Fomin, Fedor V. 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Incremental 2-Edge-Connectivity in Directed Graphs
  Georgiadis, Loukas ; Italiano, Giuseppe F. ; Parotsidis, Nikos 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Characterisations of Nowhere Dense Graphs (Invited Talk)
  Grohe, Martin ; Kreutzer, Stephan ; Siebertz, Sebastian 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)
  Ganian, Robert ; Montecchiani, Fabrizio ; Nöllenburg, Martin ; Zehavi, Meirav
• High-Performance Graph Algorithms (Dagstuhl Seminar 18241)
  Meyerhenke, Henning ; Peng, Richard ; Safro, Ilya
• Detecting gene breakpoints in noisy genome sequences using position-annotated colored de-Bruijn graphs
  Fiedler, Lisa ; Bernt, Matthias ; Middendorf, Martin ; Stadler, Peter F.
• Identifying disease trajectories with predicate information from a knowledge graph
  Vlietstra, Wytze J. ; Vos, Rein ; Akker, Marjan ˜van denœ ; Mulligen, Erik M. van ; Kors, Jan A.
• List 3-Coloring Graphs with No Induced $$P_6+rP_3$$ P 6 + r P 3
  Chudnovsky, Maria ; Huang, Shenwei ; Spirkl, Sophie Theresa ; Zhong, Mingxian
• Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2
  Golovach, Petr A. ; Heggernes, Pinar ; Kratsch, Dieter ; Lima, Paloma T. ; Paulusma, Daniël
• Comparing biological networks via graph compression
  Hayashida, Morihiro ; Akutsu, Tatsuya
• Strong Articulation Points and Strong Bridges in Large Scale Graphs
  Firmani, Donatella ; Georgiadis, Loukas ; Italiano, Giuseppe F. ; Laura, Luigi ; Santaroni, Federico
• DecGPU: distributed error correction on massively parallel graphics processing units using CUDA and MPI
  Liu, Yongchao ; Schmidt, Bertil ; Maskell, Douglas L.