Results 41 to 50 of about 2,459 (116)

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

A simple linear-time algorithm for finding path-decompositions of small width [PDF]

, 1994
We described a simple algorithm running in linear time for each fixed constant $k$, that either establishes that the pathwidth of a graph $G$ is greater than $k$, or finds a path-decomposition of $G$ of width at most $O(2^{k})$.
Cattell, Kevin, Dinneen, Michael J., Fellows, Michael R.   +2 more
core  

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

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

Hitting minors, subdivisions, and immersions in tournaments

, 2018
The Erd\H{o}s-P\'osa property relates parameters of covering and packing of combinatorial structures and has been mostly studied in the setting of undirected graphs.
Raymond, Jean-Florent
core   +1 more source

Parameterized Complexity of Vertex Splitting to Pathwidth at most 1 [PDF]

, 2023
Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter   +2 more
openalex   +1 more source

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

Forbidden Directed Minors and Kelly-width [PDF]

, 2014
Partial 1-trees are undirected graphs of treewidth at most one. Similarly, partial 1-DAGs are directed graphs of KellyWidth at most two. It is well-known that an undirected graph is a partial 1-tree if and only if it has no K_3 minor.
Kintali, Shiva, Zhang, Qiuyi
core  

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