„Graph Algorithms“

Suchergebnisse

3.156 Treffer

• Graph Contrastive-and-Reconstructive Hashing for Unsupervised Cross-Modal Retrieval
  Wei, Rukai ; Liu, Yu ; Cui, Heng ; Xie, Yanzhao ; Zhou, Ke
• Cut-edge centralities in an undirected graph
  Bini, Dario ; Kirkland, Steve ; Latouche, Guy ; Meini, Beatrice
• ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs
  Fomin, Fedor V. ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks
  Bamberger, Philipp ; Kuhn, Fabian ; Maus, Yannic 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Distributed Recoloring
  Bonamy, Marthe ; Ouvrard, Paul ; Rabie, Mikaël ; Suomela, Jukka ; Uitto, Jara 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems
  Bilò, Vittorio ; Caragiannis, Ioannis ; Fanelli, Angelo ; Flammini, Michele ; Monaco, Gianpiero 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• When Can Graph Hyperbolicity be Computed in Linear Time?
  Fluschnik, Till ; Komusiewicz, Christian ; Mertzios, George B. ; Nichterlein, André ; Niedermeier, Rolf ; Talmon, Nimrod
• Spanning Trees in Multipartite Geometric Graphs
  Biniaz, Ahmad ; Bose, Prosenjit ; Eppstein, David ; Maheshwari, Anil ; Morin, Pat ; Smid, Michiel
• Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
  Feldmann, Michael ; Hinnenthal, Kristian ; Scheideler, Christian 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient
  Baswana, Surender ; Gupta, Shiv ; Tulsyan, Ayush 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Stable Matching Games: Manipulation via Subgraph Isomorphism
  Gupta, Sushmita ; Roy, Sanjukta 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• 2-Connectivity in Directed Graphs (Invited Talk)
  Georgiadis, Loukas ; Italiano, Giuseppe F. ; Parotsidis, Nikos 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computational Counting (Dagstuhl Seminar 13031)
  Bürgisser, Peter ; Goldberg, Leslie Ann ; Jerrum, Mark ; Koiran, Pascal
• Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241)
  Dyer, Martin ; Feige, Uriel ; Frieze, Alan M. ; Karpinski, Marek
• A knowledge graph approach to predict and interpret disease-causing gene interactions
  Renaux, Alexandre ; Terwagne, Chloé ; Cochez, Michael ; Tiddi, Ilaria ; Nowé, Ann ; Lenaerts, Tom
• Polynomial algorithms for sparse spanners on subcubic graphs
  Gómez, R. ; Miyazawa, Flávio Keidi ; Wakabayashi, Yoshiko
• Representing Paths in Digraphs
  Dondi, Riccardo ; Popa, Alexandru 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond
  Chakraborty, Dibyayan ; Dailly, Antoine ; Das, Sandip ; Foucaud, Florent ; Gahlawat, Harmender ; Ghosh, Subir Kumar 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs
  Bellitto, Thomas ; Li, Shaohua ; Okrasa, Karolina ; Pilipczuk, Marcin ; Sorge, Manuel 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Topology of Local Computing in Networks
  Fraigniaud, Pierre ; Paz, Ami 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik