Results 61 to 70 of about 2,459 (116)
DAG-Pathwidth: Graph Algorithmic Analyses of DAG-Type Blockchain Networks
Shoji KASAHARA +3 more
openalex +2 more sources
Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation
Louis Dublois +2 more
openalex +2 more sources
Metric Embedding via Shortest Path Decompositions
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
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings
Michał Pilipczuk
openalex +2 more sources
Two Results on Layered Pathwidth and Linear Layouts
Vida Dujmović, Pat Morin, Céline Yelle
openalex +1 more source
Approximating Pathwidth for Graphs of Small Treewidth [PDF]
Carla Groenland +3 more
openalex +1 more source
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth
Mamadou Moustapha Kanté +2 more
openalex +3 more sources
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path
Meike Hatzel +5 more
openalex +2 more sources
Protocol for aerosolization challenge of mice with Bordetella pertussis. [PDF]
Bitzer G +3 more
europepmc +1 more source

