Introduces exact and FPT algorithms for computing the scanwidth of DAGs and phylogenetic networks, plus a heuristic with good practical performance.
In: Symposium on Theory of Com- puting Conference, STOC’13, Palo Alto, CA, USA, June 1-4
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
A condensed time-expanded network with O(n²μ) nodes and O(μmn) edges solves max flow over time with μ capacity changes in O(μ²n³m) time.
In non-modular polymatroidal service markets, revenue-optimal DSIC mechanisms cannot also be credible for strategic operators, with tight welfare-loss bounds on the Cost of Non-Credibility across network topologies.
Algorithms based on path and channel decomposition for reachability-focused hierarchical drawings of directed graphs, with experiments on bends, crossings, and clarity, running in O(kn+m) time.
citing papers explorer
-
Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
Introduces exact and FPT algorithms for computing the scanwidth of DAGs and phylogenetic networks, plus a heuristic with good practical performance.
-
Brief announcement: A special case of maximum flow over time with network changes
A condensed time-expanded network with O(n²μ) nodes and O(μmn) edges solves max flow over time with μ capacity changes in O(μ²n³m) time.
-
Credibility Trilemma in Polymatroidal Service Markets
In non-modular polymatroidal service markets, revenue-optimal DSIC mechanisms cannot also be credible for strategic operators, with tight welfare-loss bounds on the Cost of Non-Credibility across network topologies.
-
Adventures in Abstraction: Reachability in Hierarchical Drawings
Algorithms based on path and channel decomposition for reachability-focused hierarchical drawings of directed graphs, with experiments on bends, crossings, and clarity, running in O(kn+m) time.