„Directed Graph“

Suchergebnisse

719 Treffer

• Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
  Chan, Chun-Hsiang ; Laekhanukit, Bundit ; Wei, Hao-Ting ; Zhang, Yuhao 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions
  Ogihara, Mitsunori ; Uchizawa, Kei 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs
  Conte, Alessio ; Crescenzi, Pierluigi ; Marino, Andrea ; Punzi, Giulia 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Conditionally Optimal Approximation Algorithms for the Girth of a Directed Graph
  Dalirrooyfard, Mina ; Vassilevska Williams, Virginia 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Simplifying and Unifying Replacement Paths Algorithms in Weighted Directed Graphs
  Chechik, Shiri ; Nechushtan, Moran 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Efficient Algorithm for 1-Dimensional (Persistent) Path Homology
  Dey, Tamal K. ; Li, Tianqi ; Wang, Yusu 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Simplifying Activity-On-Edge Graphs
  Eppstein, David ; Frishberg, Daniel ; Havvaei, Elham 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Asymptotics of Minimal Deterministic Finite Automata Recognizing a Finite Binary Language
  Elvey Price, Andrew ; Fang, Wenjie ; Wallner, Michael 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Finding high posterior density phylogenies by systematically extending a directed acyclic graph
  Jennings-Shaffer, Chris ; Rich, David H. ; Macaulay, Matthew ; Karcher, Michael D. ; Ganapathy, Tanvi ; Kiami, Shosuke ; Kooperberg, Anna ; Zhang, Cheng ; Suchard, Marc A. ; Matsen, Frederick A.
• Exact Byzantine Consensus on Arbitrary Directed Graphs Under Local Broadcast Model
  Khan, Muhammad Samir ; Tseng, Lewis ; Vaidya, Nitin H. 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion
  Carpenter, Timothy ; Salmasi, Ario ; Sidiropoulos, Anastasios 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
  Karczmarz, Adam ; Łącki, Jakub 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computing k-Modal Embeddings of Planar Digraphs
  Besa, Juan José ; Da Lozzo, Giordano ; Goodrich, Michael A. 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Topologically Trivial Closed Walks in Directed Surface Graphs
  Erickson, Jeff ; Wang, Yipu 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Complexity of the Steiner Network Problem with Respect to the Number of Terminals
  Eiben, Eduard ; Knop, Dušan ; Panolan, Fahad ; Suchý, Ondřej 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Directed Graph Minors and Serial-Parallel Width
  Deligkas, Argyrios ; Meir, Reshef 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Average Case Analysis of Leaf-Centric Binary Tree Sources
  Seelbach Benkner, Louisa ; Lohrey, Markus 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Number of Variables in Special Classes of Random Lambda-Terms
  Gittenberger, Bernhard ; Larcher, Isabella 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Isomorphism Test for Digraphs with Weighted Edges
  Piperno, Adolfo 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts
  Huang, Shang-En ; Pettie, Seth 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik