The following pages link to Topological Bandwidth (Q3691781):
Displaying 40 items.
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- Fast searching games on graphs (Q411259) (← links)
- The fast search number of a Cartesian product of graphs (Q526821) (← links)
- Fast edge searching and fast searching on graphs (Q631784) (← links)
- The treewidth of line graphs (Q723884) (← links)
- On minimizing width in linear layouts (Q751660) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Nondeterministic graph searching: from pathwidth to treewidth (Q1024783) (← links)
- Edge searching weighted graphs (Q1026157) (← links)
- Standard directed search strategies and their applications (Q1029267) (← links)
- On embedding graphs in trees (Q1103631) (← links)
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
- Graphs with small bandwidth and cutwidth (Q1117949) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Helicopter search problems, bandwidth and pathwidth (Q1392549) (← links)
- Edge and node searching problems on trees (Q1575444) (← links)
- Scatter search for the cutwidth minimization problem (Q1761768) (← links)
- The fast search number of a complete \(k\)-partite graph (Q1799234) (← links)
- On the domination search number (Q1811076) (← links)
- Linear graph grammars: Power and complexity (Q1825679) (← links)
- Optimal labelling of unit interval graphs (Q1906576) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- Decomposability of a class of \(k\)-cutwidth critical graphs (Q2125221) (← links)
- Synchronous context-free grammars and optimal linear parsing strategies (Q2353407) (← links)
- On the bandwidth of the Kneser graph (Q2357135) (← links)
- Efficient reassembling of graphs. I: The linear case (Q2359807) (← links)
- The theory of guaranteed search on graphs (Q2439841) (← links)
- Fast searching on cactus graphs (Q2696935) (← links)
- Fast Searching on Complete k-partite Graphs (Q2958311) (← links)
- Fast Searching on Cartesian Products of Graphs (Q2988858) (← links)
- On the Cutwidth and the Topological Bandwidth of a Tree (Q3679205) (← links)
- A variation on the min cut linear arrangement problem (Q3785979) (← links)
- Searching expenditure and interval graphs (Q4242800) (← links)
- Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$ (Q4288206) (← links)
- (Q5091271) (← links)
- A polynomial algorithm for recognizing bounded cutwidth in hypergraphs (Q5748885) (← links)
- Bandwidth and topological bandwidth of graphs with few \(P_4\)'s (Q5954243) (← links)
- Edge searching and fast searching with constraints (Q6122599) (← links)
- Constrained graph searching on trees (Q6535820) (← links)
- Parameterized algorithms for minimum sum vertex cover (Q6547957) (← links)
