„Graph algorithms“

Suchergebnisse

3.156 Treffer

• A Constant-Factor Approximation for Weighted Bond Cover
  Kim, Eun Jung ; Lee, Euiwoong ; Thilikos, Dimitrios M. 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Component Order Connectivity in Directed Graphs
  Bang-Jensen, Jørgen ; Eiben, Eduard ; Gutin, Gregory Z. ; Wahlström, Magnus ; Yeo, Anders 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parallel Batch-Dynamic Trees via Change Propagation
  Acar, Umut A. ; Anderson, Daniel ; Blelloch, Guy E. ; Dhulipala, Laxman ; Westrick, Sam 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Faster Algorithms for All-Pairs Bounded Min-Cuts
  Abboud, Amir ; Georgiadis, Loukas ; Italiano, Giuseppe F. ; Krauthgamer, Robert ; Parotsidis, Nikos ; Trabelsi, Ohad ; Uznański, Przemysław ; Wolleb-Graf, Daniel 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
  Chitnis, Rajesh ; Feldmann, Andreas Emil ; Manurangsi, Pasin 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs
  Kolay, Sudeshna ; Panolan, Fahad ; Raman, Venkatesh ; Saurabh, Saket 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461)
  Meyer, Ulrich Carsten ; Meyerhenke, Henning ; Pinar, Ali ; Safro, Ilya
• Collapsed lung disease classification by coupling denoising algorithms and deep learning techniques
  Chutia, Upasana ; Tewari, Anand Shanker ; Singh, Jyoti Prakash
• Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
  Misra, Pranabendu ; Saurabh, Saket ; Sharma, Roohani ; Zehavi, Meirav
• Guidelines for Experimental Algorithmics: A Case Study in Network Analysis
  Angriman, Eugenio ; Meyerhenke, Henning ; Nöllenburg, Martin ; Predari, Maria ; Tzovas, Charilaos 2019 Humboldt-Universität zu Berlin
• Maximum Plane Trees in Multipartite Geometric Graphs
  Biniaz, Ahmad ; Bose, Prosenjit ; Crosbie, Kimberly ; Carufel, Jean-Lou De ; Eppstein, David ; Maheshwari, Anil ; Smid, Michiel
• Temporal Unit Interval Independent Sets
  Hermelin, Danny ; Itzhaki, Yuval ; Molter, Hendrik ; Niedermeier, Rolf 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Path Contraction Faster Than 2^n
  Agrawal, Akanksha ; Fomin, Fedor V. ; Lokshtanov, Daniel ; Saurabh, Saket ; Tale, Prafullkumar 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Cluster Editing in Multi-Layer and Temporal Graphs
  Chen, Jiehua ; Molter, Hendrik ; Sorge, Manuel ; Suchý, Ondrej 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Survivable Network Design for Group Connectivity in Low-Treewidth Graphs
  Chalermsook, Parinya ; Das, Syamantak ; Even, Guy ; Laekhanukit, Bundit ; Vaz, Daniel 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Decremental Data Structures for Connectivity and Dominators in Directed Graphs
  Georgiadis, Loukas ; Dueholm Hansen, Thomas ; Italiano, Giuseppe F. ; Krinninger, Sebastian ; Parotsidis, Nikos 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion
  Eiben, Eduard ; Ganian, Robert ; Kwon, O-joung 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parallel path progression DAG scheduling
  Ueter, Niklas ; Günzel, Mario ; Brüggen, Georg ˜von derœ ; Chen, Jian-Jia 2023 Universitätsbibliothek Dortmund
• DrugRep-HeSiaGraph: when heterogenous siamese neural network meets knowledge graphs for drug repurposing
  Ghorbanali, Zahra ; Zare-Mirakabad, Fatemeh ; Salehi, Najmeh ; Akbari, Mohammad ; Masoudi-Nejad, Ali
• Parameterized Inapproximability of Independent Set in H-Free Graphs
  Dvořák, Pavel ; Feldmann, Andreas Emil ; Rai, Ashutosh ; Rzążewski, Paweł