Pages that link to "Item:Q1198094"
From MaRDI portal
The following pages link to The vertex separation number of a graph equals its path-width (Q1198094):
Displayed 50 items.
- Approximating the pathwidth of outerplanar graphs (Q293398) (← links)
- On the monotonicity of process number (Q299059) (← links)
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
- Variable neighborhood search for the vertex separation problem (Q339678) (← links)
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- Faster algorithms for finding and counting subgraphs (Q439930) (← links)
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width (Q463068) (← links)
- Computing the pathwidth of directed graphs with small vertex cover (Q477674) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- Neighbourhood-width of trees (Q501055) (← links)
- Computing the vertex separation of unicyclic graphs (Q596295) (← links)
- A note on exact algorithms for vertex ordering problems on graphs (Q692902) (← links)
- The treewidth of line graphs (Q723884) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- Strong-mixed searching and pathwidth (Q867027) (← links)
- On the treewidth of toroidal grids (Q897618) (← links)
- The complexity of zero-visibility cops and robber (Q897941) (← links)
- Network decontamination under \(m\)-immunity (Q908298) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Digraph searching, directed vertex separation and directed pathwidth (Q944735) (← links)
- Minimum dominating set of queens: a trivial programming exercise? (Q968146) (← links)
- CSP duality and trees of bounded pathwidth (Q986555) (← links)
- Derivation of algorithms for cutwidth and related graph layout parameters (Q1015810) (← links)
- Edge searching weighted graphs (Q1026157) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Fugitive-search games on graphs and related parameters (Q1392025) (← links)
- Interval degree and bandwidth of a graph (Q1406031) (← links)
- On the monotonicity of games generated by symmetric submodular functions. (Q1410686) (← links)
- Edge and node searching problems on trees (Q1575444) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- The structure of obstructions to treewidth and pathwidth (Q1613365) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- Glauber dynamics on trees and hyperbolic graphs (Q1780979) (← links)
- Approximate search strategies for weighted trees (Q1929222) (← links)
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines (Q1941954) (← links)
- On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
- The treewidth of proofs (Q2013559) (← links)
- On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering (Q2034395) (← links)
- Parameterized algorithms for book embedding problems (Q2206870) (← links)
- Characterization of graphs and digraphs with small process numbers (Q2275910) (← links)
- On the hardness of palletizing bins using FIFO queues (Q2330097) (← links)
- Zero-visibility cops and robber and the pathwidth of a graph (Q2343977) (← links)
- Locating a robber with multiple probes (Q2411615) (← links)
- A lower bound for the vertex boundary-width of complete \(k\)-ary trees (Q2427498) (← links)
- A distributed algorithm for computing the node search number in trees (Q2429351) (← links)
- The theory of guaranteed search on graphs (Q2439841) (← links)
- Imbalance is fixed parameter tractable (Q2445234) (← links)
- Three-fast-searchable graphs (Q2446838) (← links)
- Node-searching problem on block graphs (Q2462351) (← links)