„directed graph“

Suchergebnisse

719 Treffer

• 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
• Money and prices: U.S. Data 1869–1914 (A study with directed graphs)
  Bessler, David A. ; Lee, Seongpyo
• The Isomorphism Problem of Power Graphs and a Question of Cameron
  Das, Bireswar ; Ghosh, Jinia ; Kumar, Anant 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Polygonally Anchored Graph Drawing (Poster Abstract)
  Chiu, Alvin ; Eldawy, Ahmed ; Goodrich, Michael T. 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Solving Directed Multiway Cut Faster Than 2ⁿ
  Xiao, Mingyu 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs
  Chekuri, Chandra ; Jain, Rhea ; Kulkarni, Shubhang ; Zheng, Da Wei ; Zhu, Weihao 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
  Sun, Hao 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs
  Chauhan, Archit ; Datta, Samir ; Gupta, Chetan ; Sharma, Vimal Raj 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Asymptotics of Relaxed k-Ary Trees
  Ghosh Dastidar, Manosij ; Wallner, Michael 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Determining Fixed-Length Paths in Directed and Undirected Edge-Weighted Graphs
  Hambly, Daniel ; Lewis, Rhyd ; Corcoran, Padraig 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Practical Minimum Path Cover
  Cáceres, Manuel ; Mumey, Brendan ; Toivonen, Santeri ; Tomescu, Alexandru I. 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Better Sparsifiers for Directed Eulerian Graphs
  Sachdeva, Sushant ; Thudi, Anvith ; Zhao, Yibin 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs
  Feng, Weiming ; Guo, Heng 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• From Cubes to Twisted Cubes via Graph Morphisms in Type Theory
  Pinyo, Gun ; Kraus, Nicolai 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders
  Georgiadis, Loukas ; Italiano, Giuseppe F. ; Karanasiou, Aikaterini 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Graph-Drawing Supported Identification of Influential Students at Schools (Poster Abstract)
  Chimani, Markus ; Kröger, Lea ; Liedtke, Juliane ; Mevert, Jonah ; Shani, Maor ; Zalk, Maarten ˜vanœ 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A map-reduce algorithm to find strongly connected components of directed graphs
  Ji, Fujun ; Jin, Jidong
• Multidimensional Quantum Walks, Recursion, and Quantum Divide & Conquer
  Jeffery, Stacey ; Pass, Galina 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Randomized Heuristics for Exploiting Jacobian Scarcity
  Lyons, Andrew ; Safro, Ilya
• Low-Memory Tour Reversal in Directed Graphs
  Mosenkis, Viktor ; Naumann, Uwe ; Peise, Elmar