Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,757 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
Directed Path-Width and Directed Tree-Width of Directed Co-graphs
Frank Gurski
,
Carolin Rehs
International Computing and Combinatorics…
2018
Corpus ID: 49615214
In this paper we consider the directed path-width and directed tree-width of directed co-graphs. As an important combinatorial…
Expand
2018
2018
Stability of DC Networks with Generic Load Models
Kathleen Cavanagh
,
P. Vorobev
,
K. Turitsyn
arXiv.org
2018
Corpus ID: 3684917
DC grids are prone to small-signal instabilities due to the presence of tightly controlled loads trying to keep the power…
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
2015
2015
Peptide sequencing via graph path decomposition
Yinglei Song
,
Albert Y. Chi
Information Sciences
2015
Corpus ID: 29902947
2011
2011
A Polynomial Time Algorithm for Bounded Directed Pathwidth
H. Tamaki
International Workshop on Graph-Theoretic…
2011
Corpus ID: 45262094
We give a polynomial time algorithm for bounded directed pathwidth. Given a positive integer k and a digraph G with n vertices…
Expand
2011
2011
A general communication performance evaluation model based on routing path decomposition
A. Cheng
,
Yun Pan
,
Xiaolang Yan
,
R. Huan
Journal of Zhejiang University SCIENCE C
2011
Corpus ID: 18817509
The network-on-chip (NoC) architecture is a main factor affecting the system performance of complicated multi-processor systems…
Expand
2005
2005
Hybrid Lagrangian relaxation for bandwidth-constrained routing: knapsack decomposition
Wided Ouaja
,
B. Richards
ACM Symposium on Applied Computing
2005
Corpus ID: 17797301
To deliver quality of service, internet service providers are seeking effective solutions to optimize their networks. One of the…
Expand
2001
2001
An Improved Lower Bound for Crossing Numbers
H. Djidjev
,
I. Vrto
International Symposium Graph Drawing and Network…
2001
Corpus ID: 26515078
The crossing number of a graph G = (V,E), denoted by cr(G), is the smallest number of edge crossings in any drawing of G in the…
Expand
Highly Cited
1988
Highly Cited
1988
Explicit formulation of delays in CMOS data paths
D. Deschacht
,
M. Robert
,
D. Auvergne
1988
Corpus ID: 62751431
An explicit formulation of the transient response of general combinational CMOS structures is presented, including load…
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
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE