Results 91 to 100 of about 3,161 (171)
On the complexity of freezing automata networks of bounded pathwidth [PDF]
, 2023 Eric Goles +3 more
openalex +1 more source
Metric Embedding via Shortest Path Decompositions
, 2019 We study the problem of embedding shortest-path metrics of weighted graphs into $\ell_p$ spaces. We introduce a new embedding technique based on low-depth decompositions of a graph via shortest paths.
Abraham, Ittai +3 more
core
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. [PDF]
Algorithmica, 2022 Gąsieniec L, Klasing R, Radzik T.
europepmc +1 more source
Narrowness, pathwidth, and their application in natural language processing
Discrete Applied Mathematics, 1992 Let \(G=(V,E)\) be an ordered graph and \((v_ 1,\dots,v_ n)\) be the sequence of vertices, going through the shack (a storage unit with the condition that a vertex can be moved from the shack only if all the vertices connected to it are also in the shack or already were moved out).
Zsolt Tuza +2 more
openaire +3 more sources
DAG-Pathwidth: Graph Algorithmic Analyses of DAG-Type Blockchain Networks
IEICE Trans. Inf. Syst., 2023 S. Kasahara +3 more
semanticscholar +1 more source
Protocol for aerosolization challenge of mice with Bordetella pertussis. [PDF]
STAR Protoc, 2023 Bitzer G +3 more
europepmc +1 more source
Pathwidth of outerplanar graphs
, 2006 We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin, after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geometric) dual plus two, conjectured that there exists a constant $c ...
Coudert, David +2 more
openaire +1 more source
Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings [PDF]
, 2013 Thérèse Biedl +5 more
openalex +1 more source