Topological Bandwidth
From MaRDI portal
Recommendations
Cites work
- Bandwidth and pebbling
- Bandwidth constraints on problems complete for polynomial time
- Black-white pebbles and graph separation
- Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
- Complexity Results for Bandwidth Minimization
- Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
- scientific article; zbMATH DE number 3733986 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3410504 (Why is no real title available?)
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- On arithmetic expressions and trees
- On eliminating nondeterminism from Turing machines which use less than logarithm worktape space
- On the Cutwidth and the Topological Bandwidth of a Tree
- One-dimensional logic gate assignment and interval graphs
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
- The bandwidth problem for graphs and matrices—a survey
- The NP-completeness of the bandwidth minimization problem
- Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
Cited in
(49)- Nondeterministic graph searching: from pathwidth to treewidth
- Edge searching weighted graphs
- Standard directed search strategies and their applications
- On embedding graphs in trees
- Min Cut is NP-complete for edge weighted trees
- Graphs with small bandwidth and cutwidth
- A partial k-arboretum of graphs with bounded treewidth
- Helicopter search problems, bandwidth and pathwidth
- Edge and node searching problems on trees
- Scatter search for the cutwidth minimization problem
- The fast search number of a complete \(k\)-partite graph
- On the domination search number
- Linear graph grammars: Power and complexity
- Optimal labelling of unit interval graphs
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
- Decomposability of a class of \(k\)-cutwidth critical graphs
- Synchronous context-free grammars and optimal linear parsing strategies
- On the bandwidth of the Kneser graph
- Efficient reassembling of graphs. I: The linear case
- The theory of guaranteed search on graphs
- Cyclic bandwidth with an edge added
- Fast searching on cactus graphs
- Fast searching on complete k-partite graphs
- Fast searching on Cartesian products of graphs
- scientific article; zbMATH DE number 3858434 (Why is no real title available?)
- Branch and bound for the cutwidth minimization problem
- On the Cutwidth and the Topological Bandwidth of a Tree
- scientific article; zbMATH DE number 3914372 (Why is no real title available?)
- A variation on the min cut linear arrangement problem
- scientific article; zbMATH DE number 4070955 (Why is no real title available?)
- Fast searching games on graphs
- Searching expenditure and interval graphs
- Congestion optimale du plongement de l’hypercube H (n) dans la chaîne P(2ⁿ)
- scientific article; zbMATH DE number 1150205 (Why is no real title available?)
- Graph and string parameters: connections between pathwidth, cutwidth and the locality number
- The fast search number of a Cartesian product of graphs
- A polynomial algorithm for recognizing bounded cutwidth in hypergraphs
- Bandwidth and topological bandwidth of graphs with few \(P_4\)'s
- Fast searching on k-combinable graphs
- Edge searching and fast searching with constraints
- Fast edge searching and fast searching on graphs
- Constrained graph searching on trees
- Parameterized algorithms for minimum sum vertex cover
- Edge-maximal graphs with cutwidth at most three
- Parameterized algorithms for minimum sum vertex cover
- The treewidth of line graphs
- Graph and string parameters: connections between pathwidth, cutwidth and the locality number
- On minimizing width in linear layouts
- An annotated bibliography on guaranteed graph searching
This page was built for publication: Topological Bandwidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3691781)
