Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Acta InformaticaAlgorithmicaApex graphCMOS

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
In this paper we consider the directed path-width and directed tree-width of directed co-graphs. As an important combinatorial… 
2017
2017
Dictionary Matching with a Bounded Gap in Pattern or in Text
A gap is a sequence of don’t care characters. In this paper, we study two variants of the dictionary matching problem, where gaps… 
2016
2016
Embedded Algorithmic Noise-Tolerance for Signal Processing and Machine Learning Systems via Data Path Decomposition
Low overhead error-resiliency techniques such as algorithmic noise-tolerance (ANT) have been shown to be particularly effective… 
2015
2015
Peptide sequencing via graph path decomposition
2011
2011
A Polynomial Time Algorithm for Bounded Directed Pathwidth
We give a polynomial time algorithm for bounded directed pathwidth. Given a positive integer k and a digraph G with n vertices… 
2011
2011
A general communication performance evaluation model based on routing path decomposition
The network-on-chip (NoC) architecture is a main factor affecting the system performance of complicated multi-processor systems… 
2010
2010
A directed path-decomposition approach to exactly identifying attractors of boolean networks
We propose an approach to the problem of identifying all the attractors of a given boolean network, which is based on the… 
2005
2005
Hybrid Lagrangian relaxation for bandwidth-constrained routing: knapsack decomposition
To deliver quality of service, internet service providers are seeking effective solutions to optimize their networks. One of the… 
2001
2001
An Improved Lower Bound for Crossing Numbers
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… 
Highly Cited
1988
Highly Cited
1988
Explicit formulation of delays in CMOS data paths
An explicit formulation of the transient response of general combinational CMOS structures is presented, including load… 
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)