Results 71 to 80 of about 2,587 (156)

Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth [PDF]

, 2020
Christine T. Cheng, Will Rosenbaum
openalex   +1 more source

On Approximating Cutwidth and Pathwidth

2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)
We study graph ordering problems with a min-max objective. A classical problem of this type is cutwidth, where given a graph we want to order its vertices such that the number of edges crossing any point is minimized. We give a $ \log^{1+o(1)}(n)$ approximation for the problem, substantially improving upon the previous poly-logarithmic guarantees based
Bansal, Nikhil, Katzelnick, Dor, Schwartz, Roy   +2 more
openaire   +2 more sources

Visibility Representations of Boxes in 2.5 Dimensions

, 2016
We initiate the study of 2.5D box visibility representations (2.5D-BR) where vertices are mapped to 3D boxes having the bottom face in the plane $z=0$ and edges are unobstructed lines of sight parallel to the $x$- or $y$-axis.
A Gupta, AM Dean, AM Dean, AM Dean, AM Dean, AM Dean, E Di Giacomo, F Brandenburg, FJ Cobos, G Kant, G Liotta, I Streinu, J Štola, JD Kleitman, JP Hutchinson, ME Ahmed, MR Garey, P Bose, P Bose, P Carmi, P Duchet, P Rosenstiehl, R Tamassia, R Tamassia, S Felsner, S Sultana, SP Fekete, T Akiyama, T Bruckdorfer, W Evans   +29 more
core   +1 more source

Editorial. [PDF]

Theor Comput Sci, 2022
Calamoneri T.
europepmc   +1 more source

Does Treewidth Help in Modal Satisfiability?

, 2010
Many tractable algorithms for solving the Constraint Satisfaction Problem (CSP) have been developed using the notion of the treewidth of some graph derived from the input CSP instance.
A. Herzig, B. Cate ten, B. Courcelle, E. Fischer, G. Pan, G. Pan, H. Chen, H.L. Bodlaender, H.L. Bodlaender, I. Adler, J. Flum, J.H. Reif, J.Y. Halpern, J.Y. Halpern, M. Fellows, M. Grohe, M. Samer, M.Y. Vardi, P. Blackburn, P. Enjalbert, R. Fagin, R.E. Ladner, V. Dalmau, V.R. Pratt, Y. Kazakov   +24 more
core   +1 more source

Anagram-free Graph Colouring

, 2017
An anagram is a word of the form $WP$ where $W$ is a non-empty word and $P$ is a permutation of $W$. We study anagram-free graph colouring and give bounds on the chromatic number. Alon et al.
Wilson, Tim E., Wood, David R.
core  

Space Saving by Dynamic Algebraization

, 2014
Dynamic programming is widely used for exact computations based on tree decompositions of graphs. However, the space complexity is usually exponential in the treewidth.
A. Björklund, D. Lokshtanov, F.V. Fomin, G. Gottlob, G.-C. Rota, G.L. Miller, H.L. Bodlaender, H.L. Bodlaender, H.L. Bodlaender, H.N.V. Temperley, J. Kneis, J. Nederlof, J. Nešetřil, J.M.M. Rooij van, J.M.M. Rooij van, M. Fürer, V. Bouchitté   +16 more
core   +1 more source

2-Layer Graph Drawings with Bounded Pathwidth [PDF]

, 2022
David R. Wood
openalex   +1 more source

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

Embeddings of k-Connected Graphs of Pathwidth k

, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gupta, Arvind, Nishimura, Naomi, Proskurowski, Andrzej, Ragde, Prabhakar   +3 more
openaire   +1 more source