Results 11 to 20 of about 2,459 (116)
On Exploring Temporal Graphs of Small Pathwidth [PDF]
, 2018 We show that the Temporal Graph Exploration Problem is NP-complete, even when the underlying graph has pathwidth 2 and at each time step, the current graph is ...
Bodlaender, Hans L. +1 more
core +4 more sources
From Pathwidth to Connected Pathwidth [PDF]
, 2011 It is proven that the connected pathwidth of any graph $G$ is at most $2\cdot\pw(G)+1$, where $\pw(G)$ is the pathwidth of $G$. The method is constructive, i.e.
Dereniowski, Dariusz
core +7 more sources
Kernel Bounds for Structural Parameterizations of Pathwidth [PDF]
, 2012 Assuming the AND-distillation conjecture, the Pathwidth problem of determining whether a given graph G has pathwidth at most k admits no polynomial kernelization with respect to k.
B. Monien +14 more
core +3 more sources
Separating layered treewidth and row treewidth [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 Layered treewidth and row treewidth are recently introduced graph parameters that have been key ingredients in the solution of several well-known open problems.
Prosenjit Bose +4 more
doaj +1 more source
New Algorithms for Mixed Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A mixed dominating set is a collection of vertices and edges that dominates all vertices and edges of a graph. We study the complexity of exact and parameterized algorithms for \textsc{Mixed Dominating Set}, resolving some open questions.
Louis Dublois +2 more
doaj +1 more source
Classes of graphs with restricted interval models [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 We introduce q-proper interval graphs as interval graphs with interval models in which no interval is properly contained in more than q other intervals, and also provide a forbidden induced subgraph characterization of this class of graphs. We initiate a
Andrzej Proskurowski, Jan Arne Telle
doaj +3 more sources
A new two-variable generalization of the chromatic polynomial [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 We present a two-variable polynomial, which simultaneously generalizes the chromatic polynomial, the independence polynomial, and the matching polynomial of a graph.
Klaus Dohmen +2 more
doaj +3 more sources
Recent Advances in Positive-Instance Driven Graph Searching
Algorithms, 2022 Research on the similarity of a graph to being a tree—called the treewidth of the graph—has seen an enormous rise within the last decade, but a practically fast algorithm for this task has been discovered only recently by Tamaki (ESA 2017).
Max Bannach, Sebastian Berndt
doaj +1 more source
Effect of Steaming as Postprocessing Method on Rice Flour and Jaggery 3D Printed Construct
Journal of Food Quality, Volume 2022, Issue 1, 2022., 2022 In this study, the 3D printing of a traditional South Indian snack, “sweet pidikollukattai” has been attempted. The mixing properties of the rice flour used and thermal characteristics of the paste (rice flour, jaggery, and water) have been reported. The traditional form of the product (control) was compared with the 3D printed product, which has been ...
S. Thangalakshmi +7 more
wiley +1 more source
On the Path-Width of Integer Linear Programming [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs. For each solution there may be many graphs representing it.
Constantin Enea +3 more
doaj +1 more source