Pages that link to "Item:Q1333276"
From MaRDI portal
The following pages link to The vertex separation and search number of a graph (Q1333276):
Displaying 50 items.
- Approximating the pathwidth of outerplanar graphs (Q293398) (← 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)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Outerplanar obstructions for matroid pathwidth (Q393173) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- Neighbourhood-width of trees (Q501055) (← links)
- Exclusive graph searching (Q521823) (← links)
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
- Minimal trees of given search number (Q580350) (← links)
- Computing the vertex separation of unicyclic graphs (Q596295) (← links)
- Tradeoffs in process strategy games with application in the WDM reconfiguration problem (Q638539) (← links)
- On partitioning a graph into two connected subgraphs (Q650911) (← links)
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- How to hunt an invisible rabbit on a graph (Q896060) (← links)
- The complexity of zero-visibility cops and robber (Q897941) (← links)
- Monotonicity of non-deterministic graph searching (Q930888) (← links)
- The role of information in the cop-robber game (Q930890) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Digraph searching, directed vertex separation and directed pathwidth (Q944735) (← links)
- CSP duality and trees of bounded pathwidth (Q986555) (← links)
- Monotony properties of connected visible graph searching (Q999260) (← links)
- Nondeterministic graph searching: from pathwidth to treewidth (Q1024783) (← links)
- Edge searching weighted graphs (Q1026157) (← links)
- Pathwidth of cubic graphs and exact algorithms (Q1045933) (← links)
- Interval graphs and searching (Q1059088) (← links)
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
- Narrowness, pathwidth, and their application in natural language processing (Q1186169) (← links)
- The vertex separation number of a graph equals its path-width (Q1198094) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Obstruction set isolation for the gate matrix layout problem (Q1336625) (← 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)
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- On the domination search number (Q1811076) (← links)
- Approximate search strategies for weighted trees (Q1929222) (← links)
- Sequentialization and procedural complexity in automata networks (Q2055976) (← links)
- Horton-Strahler number, rooted pathwidth and upward drawings of trees (Q2059912) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- Between clique-width and linear clique-width of bipartite graphs (Q2185929) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Four-searchable biconnected outerplanar graphs (Q2243137) (← links)
- Contiguous search problem in Sierpiński graphs (Q2272196) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- Zero-visibility cops and robber and the pathwidth of a graph (Q2343977) (← links)
