SIAM Journal on Discrete Mathematics, ISSN 0895-4801, 2012, Volume 26, Issue 4, pp. 1709 - 1732

It is proven that the connected pathwidth of any graph G is at most 2 . pw(G) + 1, where pw(G) is the pathwidth of G. The method is constructive, i.e., it...

Graph searching | Connected pathwidth | Connected searching | Pathwidth | Fugitive search games | connected pathwidth | WEIGHTED TREES | MINORS | MATHEMATICS, APPLIED | NUMBER | graph searching | fugitive search games | CHORDAL GRAPHS | pathwidth | WIDTH | connected searching | Computer Science - Discrete Mathematics

Graph searching | Connected pathwidth | Connected searching | Pathwidth | Fugitive search games | connected pathwidth | WEIGHTED TREES | MINORS | MATHEMATICS, APPLIED | NUMBER | graph searching | fugitive search games | CHORDAL GRAPHS | pathwidth | WIDTH | connected searching | Computer Science - Discrete Mathematics

Journal Article

Algorithmica, ISSN 0178-4617, 7/2019, Volume 81, Issue 7, pp. 2795 - 2828

Deciding if a graph has a square root is a classical problem, which has been studied extensively both from graph-theoretic and algorithmic perspective. As the...

Computer Systems Organization and Communication Networks | Outerplanar graphs | Algorithms | Graphs of pathwidth 2 | Mathematics of Computing | Computer Science | Graph square root | Theory of Computation | Algorithm Analysis and Problem Complexity | Data Structures and Information Theory | Computer science

Computer Systems Organization and Communication Networks | Outerplanar graphs | Algorithms | Graphs of pathwidth 2 | Mathematics of Computing | Computer Science | Graph square root | Theory of Computation | Algorithm Analysis and Problem Complexity | Data Structures and Information Theory | Computer science

Journal Article

Journal of Experimental Algorithmics (JEA), ISSN 1084-6654, 11/2016, Volume 21, Issue 1, pp. 1 - 23

Path decompositions of graphs are an important ingredient of dynamic programming algorithms for solving efficiently many NP-hard problems. Therefore, computing...

pathwidth | Graph | vertex separation | branch-and-bound | directed pathwidth | Vertex separation | Branch-andbound | Directed pathwidth | Pathwidth | Networking and Internet Architecture | Data Structures and Algorithms | Computer Science | Discrete Mathematics

pathwidth | Graph | vertex separation | branch-and-bound | directed pathwidth | Vertex separation | Branch-andbound | Directed pathwidth | Pathwidth | Networking and Internet Architecture | Data Structures and Algorithms | Computer Science | Discrete Mathematics

Journal Article

Information and Computation, ISSN 0890-5401, 02/2017, Volume 252, pp. 243 - 260

In Graph Searching, a team of searchers aims at capturing an invisible fugitive moving arbitrarily fast in a graph. Equivalently, the searchers try to clear a...

Graph searching | Pathwidth | MATHEMATICS, APPLIED | NUMBER | TREES | COGRAPHS | ALGORITHM | CHORDAL GRAPHS | COMPUTER SCIENCE, THEORY & METHODS | Computer Science | Computational Complexity

Graph searching | Pathwidth | MATHEMATICS, APPLIED | NUMBER | TREES | COGRAPHS | ALGORITHM | CHORDAL GRAPHS | COMPUTER SCIENCE, THEORY & METHODS | Computer Science | Computational Complexity

Journal Article

Algorithmica, ISSN 0178-4617, 05/2016, Volume 75, Issue 1, pp. 138 - 157

To access, purchase, authenticate, or subscribe to the full-text of this article, please visit this link: http://dx.doi.org/10.1007/s00453-015-0015-9 We give...

Pathwidth | Exact exponential algorithm | Graph algorithm | Computer science | Algorithms

Pathwidth | Exact exponential algorithm | Graph algorithm | Computer science | Algorithms

Journal Article

Information Processing Letters, ISSN 0020-0190, 02/2019, Volume 142, pp. 68 - 71

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...

Temporal graphs | Graph algorithms | Pathwidth | Computational complexity | Graph exploration | Computer Science Applications | Theoretical Computer Science | Information Systems | Signal Processing | COMPUTER SCIENCE, INFORMATION SYSTEMS | Computer science | Algorithms | Hardness | Analysis

Temporal graphs | Graph algorithms | Pathwidth | Computational complexity | Graph exploration | Computer Science Applications | Theoretical Computer Science | Information Systems | Signal Processing | COMPUTER SCIENCE, INFORMATION SYSTEMS | Computer science | Algorithms | Hardness | Analysis

Journal Article

Discrete Mathematics, ISSN 0012-365X, 02/2014, Volume 315-316, Issue 1, pp. 95 - 101

For each non-negative integer k, we provide all outerplanar obstructions for the class of graphs whose cycle matroid has pathwidth at most k. Our proof...

Matroids | Obstructions | Outerplanar graphs | Pathwidth | BOUNDED BRANCH-WIDTH | SEARCH NUMBER | EXCLUDED MINORS | VERTEX SEPARATION | GRAPHS | MATHEMATICS | PATH-WIDTH | LINEAR-WIDTH | 3-CONNECTED MATROIDS | Algorithms | Integers | Lower bounds | Mathematical analysis | Proving | Graphs | Decomposition | Computer Science | Discrete Mathematics | Computational Complexity

Matroids | Obstructions | Outerplanar graphs | Pathwidth | BOUNDED BRANCH-WIDTH | SEARCH NUMBER | EXCLUDED MINORS | VERTEX SEPARATION | GRAPHS | MATHEMATICS | PATH-WIDTH | LINEAR-WIDTH | 3-CONNECTED MATROIDS | Algorithms | Integers | Lower bounds | Mathematical analysis | Proving | Graphs | Decomposition | Computer Science | Discrete Mathematics | Computational Complexity

Journal Article

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, ISSN 0916-8508, 06/2015, Volume E98A, Issue 6, pp. 1168 - 1178

We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only one vertex color assignment at a time,...

List coloring | PSPACE-complete | Pathwidth | Reachability on solution space | Graph algorithm | Reconfiguration | reachability on solution space | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMPUTER SCIENCE, INFORMATION SYSTEMS | pathwidth | reconfiguration | graph algorithm | ENGINEERING, ELECTRICAL & ELECTRONIC | CONNECTIVITY | SHORTEST PATHS | COMPLEXITY | TREE | list coloring | EDGE-COLORINGS

List coloring | PSPACE-complete | Pathwidth | Reachability on solution space | Graph algorithm | Reconfiguration | reachability on solution space | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMPUTER SCIENCE, INFORMATION SYSTEMS | pathwidth | reconfiguration | graph algorithm | ENGINEERING, ELECTRICAL & ELECTRONIC | CONNECTIVITY | SHORTEST PATHS | COMPLEXITY | TREE | list coloring | EDGE-COLORINGS

Journal Article

Combinatorica, ISSN 0209-9683, 6/2013, Volume 33, Issue 3, pp. 349 - 374

We prove that, for every integer k≥1, every shortest-path metric on a graph of pathwidth k embeds into a distribution over random trees with distortion at most...

05C21 | Mathematics, general | 05C12 | Mathematics | Combinatorics | MATHEMATICS | FLOWS | GRAPHS | Computer science

05C21 | Mathematics, general | 05C12 | Mathematics | Combinatorics | MATHEMATICS | FLOWS | GRAPHS | Computer science

Journal Article

Order, ISSN 0167-8094, 7/2016, Volume 33, Issue 2, pp. 195 - 212

Joret, Micek, Milans, Trotter, Walczak, and Wang recently asked if there exists a constant d such that if P is a poset with cover graph of P of pathwidth at...

Geometry | Cover graph | Discrete Mathematics in Computer Science | Poset | Mathematics | Theory of Computation | Dimension | Pathwidth | MINORS | MATHEMATICS | WIDTH | Mathematics - Combinatorics

Geometry | Cover graph | Discrete Mathematics in Computer Science | Poset | Mathematics | Theory of Computation | Dimension | Pathwidth | MINORS | MATHEMATICS | WIDTH | Mathematics - Combinatorics

Journal Article

Information Processing Letters, ISSN 0020-0190, 02/2015, Volume 115, Issue 2, pp. 310 - 312

•We study the problem of computing the pathwidth of directed graphs.•We show that the problem is FPT when parameterized by vertex cover number.•This result...

Vertex separation | Vertex cover | Graph algorithms | Pathwidth | Fixed parameter tractable | PATH-WIDTH | TREEWIDTH | COMPUTER SCIENCE, INFORMATION SYSTEMS | SEPARATION | Algorithms | Computation | Data processing | Graphs | Graph theory | Dynamic programming | Standards

Vertex separation | Vertex cover | Graph algorithms | Pathwidth | Fixed parameter tractable | PATH-WIDTH | TREEWIDTH | COMPUTER SCIENCE, INFORMATION SYSTEMS | SEPARATION | Algorithms | Computation | Data processing | Graphs | Graph theory | Dynamic programming | Standards

Journal Article

12.
Full Text
A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP

Algorithmica, ISSN 0178-4617, 8/2015, Volume 72, Issue 4, pp. 940 - 968

We prove a general reduction theorem which allows us to extend bounds for certain graph parameters on cubic graphs to bounds for general graphs taking into...

Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Mathematics of Computing | Computer Science | Theory of Computation | Constraint satisfaction problems | Pathwidth | Algorithm Analysis and Problem Complexity | Max 2-CSP | Treewidth | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | UPPER-BOUNDS | SATISFACTION | CUT | MAX-2-SAT | SPARSE GRAPHS | EXACT ALGORITHMS

Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Mathematics of Computing | Computer Science | Theory of Computation | Constraint satisfaction problems | Pathwidth | Algorithm Analysis and Problem Complexity | Max 2-CSP | Treewidth | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | UPPER-BOUNDS | SATISFACTION | CUT | MAX-2-SAT | SPARSE GRAPHS | EXACT ALGORITHMS

Journal Article

Algorithmica, ISSN 0178-4617, 5/2016, Volume 75, Issue 1, pp. 138 - 157

We give an algorithm for computing the directed pathwidth of a digraph with n vertices in $$O(1.89^{n})$$ O ( 1 . 89 n ) time. This is the first algorithm with...

Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Mathematics of Computing | Computer Science | Exact exponential algorithm | Theory of Computation | Pathwidth | Algorithm Analysis and Problem Complexity | Graph algorithm

Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Mathematics of Computing | Computer Science | Exact exponential algorithm | Theory of Computation | Pathwidth | Algorithm Analysis and Problem Complexity | Graph algorithm

Journal Article

IEICE Transactions on Information and Systems, ISSN 0916-8532, 2015, Volume E98.D, Issue 3, pp. 503 - 511

Computing an invariant of a graph such as treewidth and pathwidth is one of the fundamental problems in graph algorithms. In general, determining the pathwidth...

graphs | pathwidth | exact algorithms | chemical graphs | Chemical graphs | Graphs | Pathwidth | Exact algorithms | MINORS | COMPUTER SCIENCE, SOFTWARE ENGINEERING | TREEWIDTH | COMPUTER SCIENCE, INFORMATION SYSTEMS | ALGORITHMS | TREE-WIDTH

graphs | pathwidth | exact algorithms | chemical graphs | Chemical graphs | Graphs | Pathwidth | Exact algorithms | MINORS | COMPUTER SCIENCE, SOFTWARE ENGINEERING | TREEWIDTH | COMPUTER SCIENCE, INFORMATION SYSTEMS | ALGORITHMS | TREE-WIDTH

Journal Article

Discrete Mathematics, ISSN 0012-365X, 2011, Volume 311, Issue 10, pp. 881 - 887

We study the bandwidth and the pathwidth of multi-dimensional grids. It can be shown for grids, that these two parameters are equal to a more basic graph...

Vertex isoperimetric problem | Pathwidth | Bandwidth | Grid | MESHES | PROOF | EVEN DISCRETE TORUS | GRAPHS | MATHEMATICS | EDGE-BANDWIDTH | PRODUCTS | CUTWIDTHS | ISOPERIMETRIC-INEQUALITIES | Byproducts | Graphs | Boundaries | Mathematical analysis

Vertex isoperimetric problem | Pathwidth | Bandwidth | Grid | MESHES | PROOF | EVEN DISCRETE TORUS | GRAPHS | MATHEMATICS | EDGE-BANDWIDTH | PRODUCTS | CUTWIDTHS | ISOPERIMETRIC-INEQUALITIES | Byproducts | Graphs | Boundaries | Mathematical analysis

Journal Article

Algorithmica, ISSN 0178-4617, 3/2009, Volume 53, Issue 3, pp. 358 - 373

We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and...

Data Structures, Cryptology and Information Theory | Computer Systems Organization and Communication Networks | Algorithms | Mathematics of Computing | Computer Science | Graph searching | Theory of Computation | Pathwidth | Algorithm Analysis and Problem Complexity | Treewidth | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | TREE | EMBEDDINGS | WIDTH | ALGORITHMS | Analysis

Data Structures, Cryptology and Information Theory | Computer Systems Organization and Communication Networks | Algorithms | Mathematics of Computing | Computer Science | Graph searching | Theory of Computation | Pathwidth | Algorithm Analysis and Problem Complexity | Treewidth | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | TREE | EMBEDDINGS | WIDTH | ALGORITHMS | Analysis

Journal Article

Discrete Mathematics, ISSN 0012-365X, 2006, Volume 306, Issue 3, pp. 359 - 365

The d-dimensional hypercube, H d , is the graph on 2 d vertices, which correspond to the 2 d d-vectors whose components are either 0 or 1, two of the vertices...

Hamming graph | Pathwidth | Hypercube | Treewidth | MATHEMATICS | GRAPH MINORS | hypercube | pathwidth | treewidth

Hamming graph | Pathwidth | Hypercube | Treewidth | MATHEMATICS | GRAPH MINORS | hypercube | pathwidth | treewidth

Journal Article

Journal of Graph Theory, ISSN 0364-9024, 05/2007, Volume 55, Issue 1, pp. 27 - 41

We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3],...

triangulation | outerplanar graphs | biconnected graphs | Outerplanar graphs | Triangulation | Biconnected graphs | MINORS | MATHEMATICS | NUMBER | TREEWIDTH | VERTEX SEPARATION | WIDTH | PLANAR | ALGORITHMS | Computer Science | Discrete Mathematics

triangulation | outerplanar graphs | biconnected graphs | Outerplanar graphs | Triangulation | Biconnected graphs | MINORS | MATHEMATICS | NUMBER | TREEWIDTH | VERTEX SEPARATION | WIDTH | PLANAR | ALGORITHMS | Computer Science | Discrete Mathematics

Journal Article

Algorithmica, ISSN 0178-4617, 9/2012, Volume 64, Issue 1, pp. 170 - 188

The Pathwidth One Vertex Deletion (POVD) problem asks whether, given an undirected graph G and an integer k, one can delete at most k vertices from G so that...

Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Mathematics of Computing | Computer Science | Theory of Computation | Pathwidth | Algorithm Analysis and Problem Complexity | Fixed parameter tractability | Kernelization | Caterpillar graph | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | GRAPH MINORS | 2-LAYER PLANARIZATION | BANDWIDTH | Computer science | Universities and colleges

Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Mathematics of Computing | Computer Science | Theory of Computation | Pathwidth | Algorithm Analysis and Problem Complexity | Fixed parameter tractability | Kernelization | Caterpillar graph | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | GRAPH MINORS | 2-LAYER PLANARIZATION | BANDWIDTH | Computer science | Universities and colleges

Journal Article

Journal of Combinatorial Optimization, ISSN 1382-6905, 4/2015, Volume 29, Issue 3, pp. 541 - 564

We examine the zero-visibility cops and robber graph searching model, which differs from the classical cops and robber game in one way: the robber is...

Convex and Discrete Geometry | Operations Research/Decision Theory | Graph searching | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Combinatorics | Cops and robber | Pathwidth | Pursuit-evasion | 05C57 | Optimization | MATHEMATICS, APPLIED | NUMBER | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | GAME | SEARCH | VERTEX SEPARATION | RANDOMIZED PURSUIT-EVASION | Computer science | Analysis | Algorithms

Convex and Discrete Geometry | Operations Research/Decision Theory | Graph searching | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Combinatorics | Cops and robber | Pathwidth | Pursuit-evasion | 05C57 | Optimization | MATHEMATICS, APPLIED | NUMBER | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | GAME | SEARCH | VERTEX SEPARATION | RANDOMIZED PURSUIT-EVASION | Computer science | Analysis | Algorithms

Journal Article

No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.