Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
graph width
Description:
A measure of graph structure used in graph theory, with different width notions capturing how a graph can be decomposed or represented.
Primary topic:
Advanced Graph Theory Research (51%)
Related topics:
Advanced Graph Theory Research (51%),
Complexity and Algorithms in Graphs (18%)
OpenAlex ID:
keywords/graph-width
Quickly excluding a forest
1991
·
Dan Bienstock
, Neil Robertson
, et al.
·
Journal of Combinatorial Theory Series B
·
151
An Efficient Algorithm for Answering Graph Reachability Queries
2008
·
Yangjun Chen
, Yibin Chen
·
IEEE International Conference on Data Engineering (ICDE)
·
144
Resolution versus Search: Two Strategies for SAT
2000
·
Irina Rish
, Rina Dechter
·
Journal of Automated Reasoning
·
126
Graph Theory
2005
·
Reinhard Diestel
, Alexander Schrijver
, et al.
·
Oberwolfach Reports
·
120
Layered separators in minor-closed graph classes with applications
2017
·
Vida Dujmović
, Pat Morin
, et al.
·
Journal of Combinatorial Theory Series B
·
116
PDF
On the complexity of embedding planar graphs to minimize certain distance measures
1990
·
Daniel Bienstock
, Clyde L. Monma
·
Algorithmica
·
82
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth
2012
·
L. R. Planken
, M. M. De Weerdt
, et al.
·
Journal of Artificial Intelligence Research
·
66
PDF
Traversing Layered Graphs Using the Work Function Algorithm
1996
·
William R. Burley
·
Journal of Algorithms
·
49
Competitive algorithms for layered graph traversal
2002
·
A. Fiat
, D.P. Foster
, et al.
·
Annual Symposium on Foundations of Computer Science
·
46
PDF
On Lehman’s width-length characterization
1991
·
P. Seymour
·
DIMACS series in discrete mathematics and theoretical computer science
·
45
Competitive Algorithms for Layered Graph Traversal
1998
·
Amos Fiat
, Dean P. Foster
, et al.
·
SIAM Journal on Computing
·
42
The Linkage of a Graph
1996
·
Lefteris M. Kirousis
, Dimitris M. Thilikos
·
SIAM Journal on Computing
·
41
Parameterized Approximation Schemes Using Graph Widths
2014
·
Michael Lampis
·
Lecture notes in computer science
·
36
Topological Aspects of Infinite Graphs
1990
·
N. Polat
·
Springer eBooks
·
32
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
2004
·
Ching-Chi Lin
, Hsueh-I Lu
, et al.
·
SIAM Journal on Discrete Mathematics
·
31
PDF
Minimum-Width Method of Variable Ordering for Binary Decision Diagrams
1992
·
Shin-ichi Minato
·
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
·
31
PDF
Exact Exponential-Time Algorithms for Domination Problems in Graphs
2011
·
Johan M. M. van Rooij
·
Utrecht University Repository (Utrecht University)
·
29
Compiling devices: a structure-based approach
1998
·
Adnan Darwiche
·
Principles of Knowledge Representation and Reasoning
·
28
Duality Theorems for Blocks and Tangles in Graphs
2017
·
Reinhard Diestel
, Philipp Eberenz
, et al.
·
SIAM Journal on Discrete Mathematics
·
27
Lower Bounds on the Area Requirements of Series-Parallel Graphs
2010
·
Fabrizio Frati
·
Discrete Mathematics & Theoretical Computer Science
·
21
PDF
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth
2011
·
Léon Planken
, Mathijs De Weerdt
, et al.
·
Proceedings of the International Conference on Automated Planning and Scheduling
·
17
PDF
On Traversing Layered Graphs On-Line
1995
·
H. Ramesh
·
Journal of Algorithms
·
17
Extending precolorings of subgraphs of locally planar graphs
2004
·
Michael O Albertson
, Joan P Hutchinson
·
European Journal of Combinatorics
·
16
PDF
A Linear-Time Parameterized Algorithm for Computing the Width of a DAG
2021
·
Manuel Cáceres
, Massimo Cairo
, et al.
·
Lecture notes in computer science
·
15
Online Problems, Pathwidth, and Persistence
2004
·
Rodney G. Downey
, Catherine McCartin
·
Lecture notes in computer science
·
15
Show more works
View as search
Works count:
105
Citation count:
1,529
Year
Topic
Type