Results 111 to 120 of about 4,791 (239)

Induced subgraphs and tree decompositions V. one neighbor in a hole

Journal of Graph Theory, Volume 105, Issue 4, Page 542-561, April 2024.
Abstract What are the unavoidable induced subgraphs of graphs with large treewidth? It is well‐known that the answer must include a complete graph, a complete bipartite graph, all subdivisions of a wall and line graphs of all subdivisions of a wall (we refer to these graphs as the “basic treewidth obstructions”).
Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl, Kristina Vušković   +5 more
wiley   +1 more source

Augmenting Naïve Bayes Classifiers with k-Tree Topology

Mathematics
The Bayesian network is a directed, acyclic graphical model that can offer a structured description for probabilistic dependencies among random variables.
Fereshteh R. Dastjerdi, Liming Cai
doaj   +1 more source

The product structure of squaregraphs

Journal of Graph Theory, Volume 105, Issue 2, Page 179-191, February 2024.
Abstract A squaregraph is a plane graph in which each internal face is a 4‐cycle and each internal vertex has degree at least 4. This paper proves that every squaregraph is isomorphic to a subgraph of the semistrong product of an outerplanar graph and a path.
Robert Hickingbotham, Paul Jungeblut, Laura Merker, David R. Wood   +3 more
wiley   +1 more source

Robust transshipment problem under consistent flow constraints

Networks, Volume 83, Issue 1, Page 53-82, January 2024.
Abstract In this article, we study robust transshipment under consistent flow constraints. We consider demand uncertainty represented by a finite set of scenarios and characterize a subset of arcs as so‐called fixed arcs. In each scenario, we require an integral flow that satisfies the respective flow balance constraints. In addition, on each fixed arc,
Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz   +2 more
wiley   +1 more source

Visualizing Treewidth

A witness drawing of a graph is a visualization that clearly shows a given property of a graph. We study and implement various drawing paradigms for witness drawings to clearly show that graphs have bounded pathwidth or treewidth. Our approach draws the tree decomposition or path decomposition as a tree of bags, with induced subgraphs shown in each bag,
Chiu, Alvin, Depian, Thomas, Eppstein, David, Goodrich, Michael T., Nöllenburg, Martin   +4 more
openaire   +4 more sources

Hitting minors on bounded treewidth graphs. III. Lower bounds [PDF]

, 2021
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos   +2 more
openalex   +1 more source

Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries [PDF]

Logical Methods in Computer Science
We show that the problem of whether a query is equivalent to a query of tree-width $k$ is decidable, for the class of Unions of Conjunctive Regular Path Queries with two-way navigation (UC2RPQs).
Diego Figueira, Rémi Morvan
doaj   +1 more source

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth [PDF]

ACM-SIAM Symposium on Discrete Algorithms, 2022
Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek   +7 more
semanticscholar   +1 more source

Cop-width, flip-width and strong colouring numbers [PDF]

Discrete Mathematics & Theoretical Computer Science
Cop-width and flip-width are new families of graph parameters introduced by Toru\'nczyk (2023) that generalise treewidth, degeneracy, generalised colouring numbers, clique-width and twin-width.
Robert Hickingbotham
doaj   +1 more source

(Sub)Fall Coloring and B-Coloring Parameterized by Treewidth

, 2022
Davi de Andrade, Ana Silva
openalex   +2 more sources