Results 51 to 60 of about 1,027 (141)

The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs [PDF]

Electronic Proceedings in Theoretical Computer Science, 2012
For some time the discrete strategy improvement algorithm due to Jurdzinski and Voge had been considered as a candidate for solving parity games in polynomial time.
Felix Canavoi, Erich Grädel, Roman Rabinovich   +2 more
doaj   +1 more source

Fractional List Packing for Layered Graphs

Journal of Graph Theory, Volume 113, Issue 1, Page 19-37, September 2026.
ABSTRACT The fractional list packing number χ ℓ • ( G ) of a graph G is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N need to be to ensure the existence of a “perfectly balanced” probability distribution on proper L‐colourings, that is, such ...
Stijn Cambie, Wouter Cames van Batenburg
wiley   +1 more source

A linear fixed parameter tractable algorithm for connected pathwidth [PDF]

, 2020
The graph parameter of pathwidth can be seen as a measure of the topological resemblance of a graph to a path. A popular definition of pathwidth is given in terms of node search where we are given a system of tunnels that is contaminated by some ...
Thilikos, Dimitrios M., Kanté, Mamadou Moustapha, Paul, Christophe, Thilikos, Dimitrios   +3 more
core   +2 more sources

An Improved Quasi‐Isometry Between Graphs of Bounded Cliquewidth and Graphs of Bounded Treewidth

Journal of Graph Theory, Volume 112, Issue 4, Page 409-420, August 2026.
ABSTRACT Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi‐isometric to graphs of bounded treewidth. We improve on this by showing that graphs of cliquewidth k admit a partition with ‘local,
Marc Distel
wiley   +1 more source

Structural properties of graph products

Journal of Graph Theory, Volume 109, Issue 2, Page 107-136, June 2025.
Abstract Dujmovć, Joret, Micek, Morin, Ueckerdt, and Wood established that every planar graph is a subgraph of the strong product of a graph with bounded treewidth and a path. Motivated by this result, this paper systematically studies various structural properties of cartesian, direct and strong products.
Robert Hickingbotham, David R. Wood
wiley   +1 more source

Packing independent cliques into planar graphs

Theory and Applications of Graphs
The indeque number of a graph is largest set of vertices that induce an independent set of cliques. We study the extremal value of this parameter for the class and subclasses of planar graphs, most notably for forests and graphs of pathwidth at most $2$.
Csaba Biró , Gabriel Collado, Oscar Zamora   +2 more
doaj   +1 more source

On tree decompositions whose trees are minors

Journal of Graph Theory, Volume 106, Issue 2, Page 296-306, June 2024.
Abstract In 2019, Dvořák asked whether every connected graph G $G$ has a tree decomposition ( T , B ) $(T,{\rm{ {\mathcal B} }})$ so that T $T$ is a subgraph of G $G$ and the width of ( T , B ) $(T,{\rm{ {\mathcal B} }})$ is bounded by a function of the treewidth of G $G$.
Pablo Blanco, Linda Cook, Meike Hatzel, Claire Hilaire, Freddie Illingworth, Rose McCarty   +5 more
wiley   +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

Basis Number and Pathwidth

CoRR
We prove two results relating the basis number of a graph $G$ to path decompositions of $G$. Our first result shows that the basis number of a graph is at most four times its pathwidth. Our second result shows that, if a graph $G$ has a path decomposition with adhesions of size at most $k$ in which the graph induced by each bag has basis number at most
Babak Miraftab, Pat Morin, Yelena Yuditsky   +2 more
openaire   +3 more sources

LSTM‐based deep learning framework for adaptive identifying eco‐driving on intelligent vehicle multivariate time‐series data

IET Intelligent Transport Systems, Volume 18, Issue 1, Page 186-202, January 2024.
In the context of automated driving, the connected and automated vehicles (CAVs) technology unlock the energy saving potential. This paper develops an LSTM‐based deep learning framework for eco‐driving adaptive identification on Intelligent vehicle multivariate time series data.
Lixin Yan, Le Jia, Shan Lu, Liqun Peng, Yi He   +4 more
wiley   +1 more source