„Graph algorithms“

Suchergebnisse

3.156 Treffer

• Extending Convex Partial Drawings of Graphs
  Mchedlidze, Tamara ; Nöllenburg, Martin ; Rutter, Ignaz
• Combining LEDA with Customizable Implementations of Graph Algorithms
  Nissen, Marco ; Weihe, Karsten
• Declawing a graph: polyhedra and Branch-and-Cut algorithms
  Fragoso, Felipe C. ; Sousa Filho, Gilberto F. ˜deœ ; Protti, Fábio
• Graph representation of high-dimensional alpha-helical membrane protein data
  Grunert, Steffen ; Labudde, Dirk
• Algorithms and computation – 6th international workshop ; proceedings
  Rahman, Md. Saidur ; Nakano, Shin-ichi 2012 Springer
• Algorithms and Complexity on Indexing Elastic Founder Graphs
  Equi, Massimo ; Norri, Tuukka ; Alanko, Jarno ; Cazaux, Bastien ; Tomescu, Alexandru I. ; Mäkinen, Veli 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs
  Pilipczuk, Marcin ; Pilipczuk, Michal ; Sankowski, Piotr ; van Leeuwen, Erik Jan 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An investigation into inter- and intragenomic variations of graphic genomic signatures
  Karamichalis, Rallis ; Kari, Lila ; Kōnstantinidēs, Stauros ; Kopecki, Steffen
• Netzbasierte Ansätze zur natürlichsprachlichen Informationsverarbeitung
  Unger, Herwig ; Kubek, Mario ; Sukjit, Panchalee 2022 Springer Fachmedien Wiesbaden
• Computational Geometry – Algorithms and Applications
  Berg, Mark Theodoor ˜deœ ; Cheong, Otfried ; Kreveld, Marc ˜vanœ ; Overmars, Mark H. 2008 Springer Berlin Heidelberg, Imprint: Springer
• Automated major psoas muscle volumetry in computed tomography using machine learning algorithms
  Duong, Felix ; Gadermayr, Michael ; Merhof, Dorit ; Kuhl, Christiane ; Bruners, Philipp ; Loosen, Sven ; Roderburg, Christoph ; Truhn, Daniel ; Schulze-Hagen, Maximilian
• High precision control and deep learning-based corn stand counting algorithms for agricultural robot
  Zhang, Zhongzhong ; Kayacan, Erkan ; Rumford, Benjamin Thompson ˜vonœ ; Chowdhary, Girish
• Listing Subgraphs by Cartesian Decomposition
  Conte, Alessio ; Grossi, Roberto ; Marino, Andrea ; Rizzi, Romeo ; Versari, Luca 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Packing Cycles Faster Than Erdos-Posa
  Lokshtanov, Daniel ; Mouawad, Amer E. ; Saurabh, Saket ; Zehavi, Meirav 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Diverse Collections in Matroids and Graphs
  Fomin, Fedor V. ; Golovach, Petr A. ; Panolan, Fahad ; Philip, Geevarghese ; Saurabh, Saket 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion
  Lokshtanov, Daniel ; Misra, Pranabendu ; Panolan, Fahad ; Philip, Geevarghese ; Saurabh, Saket 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Graph Isomorphism for $$(H_1,H_2)$$ ( H 1 , H 2 ) -Free Graphs: An Almost Complete Dichotomy
  Bonamy, Marthe ; Bousquet, Nicolas ; Dabrowski, Konrad K. ; Johnson, Matthew ; Paulusma, Daniel ; Pierron, Théo
• Reconstruction of large-scale regulatory networks based on perturbation graphs and transitive reduction: improved methods and their evaluation
  Pinna, Andrea ; Heise, Sandra ; Flassig, Robert J. ; Fuente, Alberto ˜de laœ ; Klamt, Steffen
• Composed Degree-Distance Realizations of Graphs
  Bar-Noy, Amotz ; Peleg, David ; Perry, Mor ; Rawitz, Dror
• Accelerating all-pairs shortest path algorithms for bipartite graphs on graphics processing units
  Hanif, Muhammad Kashif ; Zimmermann, Karl-Heinz ; Anees, Asad