scientific article; zbMATH DE number 7378361
From MaRDI portal
Publication:5005146
DOI10.4230/LIPIcs.MFCS.2018.44MaRDI QIDQ5005146
Argyrios Deligkas, Reshef Meir
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1711.01806
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Uses Software
Cites Work
- On the algorithmic effectiveness of digraph decompositions and complexity measures
- Forbidden directed minors and Kelly-width
- Graph minors. XX: Wagner's conjecture
- Congestion games with malicious players
- Network topology and the efficiency of equilibrium
- Parallelism and fast solution of linear systems
- Efficient graph topologies in network routing games
- Two-terminal routing games with unknown active players
- The directed subgraph homeomorphism problem
- Parallel recognition of series-parallel graphs
- Fast planning through planning graph analysis
- Network structure and strong equilibrium in route selection games.
- Directed tree-width
- NP-completeness of some edge-disjoint paths problems
- Topology of series-parallel networks
- Heuristic search viewed as path finding in a graph
- An admissible and optimal algorithm for searching AND/OR graphs
- The computational complexity of probabilistic inference using Bayesian belief networks
- Über eine Eigenschaft der ebenen Komplexe
- An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents
- Graph minor theory
- Towards the Graph Minor Theorems for Directed Graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Linear-time computability of combinatorial problems on series-parallel graphs
- Space efficient algorithms for directed series–parallel graphs
- Mathematical Foundations of Computer Science 2005
This page was built for publication:
