Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,627,658 papers from all fields of science
Search
Sign In
Create Free Account
Pathwidth
Known as:
Path Decomposition
, Path-width
, Width (disambiguation)
In graph theory, a path decomposition of a graph G is, informally, a representation of G as a "thickened" path graph, and the pathwidth of G is a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Acta Informatica
Algorithmica
Apex graph
CMOS
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Finding a Small Number of Colourful Components
L. Bulteau
,
Konrad K. Dabrowski
,
G. Fertin
,
Matthew Johnson
,
D. Paulusma
,
Stéphane Vialette
Annual Symposium on Combinatorial Pattern…
2018
Corpus ID: 51967367
A partition (V_1,...,V_k) of the vertex set of a graph G with a (not necessarily proper) colouring c is colourful if no two…
Expand
2016
2016
Embedded Algorithmic Noise-Tolerance for Signal Processing and Machine Learning Systems via Data Path Decomposition
Sai Zhang
,
Naresh R Shanbhag
IEEE Transactions on Signal Processing
2016
Corpus ID: 5566109
Low overhead error-resiliency techniques such as algorithmic noise-tolerance (ANT) have been shown to be particularly effective…
Expand
Review
2015
Review
2015
A Review on the Tree Edit Distance Problem and Related Path-Decomposition Algorithms
Shihyen Chen
arXiv.org
2015
Corpus ID: 18586791
An ordered labeled tree is a tree in which the nodes are labeled and the left-to-right order among siblings is relevant. The edit…
Expand
2004
2004
A simple polynomial time framework for reduced-path decomposition in multipath routing
M. Thottan
,
V. Mirrokni
,
H. Uzunalioglu
,
S. Paul
IEEE INFOCOM
2004
Corpus ID: 5940557
The recent reduction in telecommunications spending has increased the importance of network planning to improve the return on…
Expand
2004
2004
Online Graph Colouring
Avery Miller
2004
Corpus ID: 15490843
This paper considers the problem of online graph colouring. An algorithm for vertex-colouring graphs is said to be online if each…
Expand
1997
1997
Geostatistical analysis of 3C-3D seismic data for depth, isopachs, and sand/shale distribution.
T. Todorov
,
R. Stewart
1997
Corpus ID: 55895118
Three examples of applying geostatistical methods in the Blackfoot area, Alberta, are shown. The examples include time-to-depth…
Expand
1996
1996
The path-width of graphs and its applications
高橋 篤司
1996
Corpus ID: 124329798
1992
1992
Narrowness, Path-width, and Their Application in Natural Language Processing
Andrr As Kornai
,
Z. Tuza
1992
Corpus ID: 2863901
In the syntactic theory of Tesni ere (1959) the structural description of sentences are given as graphs. We discuss how the graph…
Expand
1991
1991
Decomposing graphs into forests of paths with size less than three
Bor-Liang Chen
,
H. Fu
,
Kuo-Ching Huang
The Australasian Journal of Combinatorics
1991
Corpus ID: 29803846
A forest in which every component is path is caned a path forest. A family of path forests whose edge sets form a partition of…
Expand
1985
1985
On path decompositions of complete graphs
K. Ng
1985
Corpus ID: 101628828
Given an undirected (directed) graph, we say G has a path decomposition if the edge-set (arc-set) E of G can be partitioned, into…
Expand