The following pages link to (Q3477966):
Displaying 50 items.
- Generic algorithms for some decision problems on fasciagraphs and rotagraphs (Q442402) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- Mixed searching and proper-path-width (Q674341) (← links)
- Connected graph searching (Q690489) (← links)
- A linear time algorithm to list the minimal separators of chordal graphs (Q819826) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- The complexity of zero-visibility cops and robber (Q897941) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- CSP duality and trees of bounded pathwidth (Q986555) (← links)
- Derivation of algorithms for cutwidth and related graph layout parameters (Q1015810) (← links)
- The minimization of open stacks problem: a review of some properties and their use in pre-processing operations (Q1046052) (← links)
- \(\alpha\)-vertex separator is NP-hard even for 3-regular graphs (Q1179551) (← links)
- Narrowness, pathwidth, and their application in natural language processing (Q1186169) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Combinatorial optimization models for production scheduling in automated manufacturing systems (Q1278813) (← links)
- Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
- On the pathwidth of chordal graphs (Q1309811) (← links)
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width (Q1322236) (← links)
- A generalized insertion algorithm for the seriation problem (Q1328867) (← links)
- PLA folding in special graph classes (Q1329804) (← links)
- A column generation approach to job grouping for flexible manufacturing systems (Q1341988) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- Fugitive-search games on graphs and related parameters (Q1392025) (← links)
- Helicopter search problems, bandwidth and pathwidth (Q1392549) (← links)
- Triangulating multitolerance graphs (Q1392575) (← 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)
- On the orderability problem for PLA folding (Q1824403) (← links)
- Triangulating graphs without asteroidal triples (Q1917255) (← 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)
- Graph theoretic analysis of PLA folding heuristics (Q2366688) (← links)
- Node-searching problem on block graphs (Q2462351) (← links)
- Linear layouts measuring neighbourhoods in graphs (Q2502893) (← links)
- A biased random-key genetic algorithm for the minimization of open stacks problem (Q2803254) (← links)
- A heuristic and an exact method for the gate matrix connection cost minimization problem (Q2862155) (← links)
- Searching expenditure and interval graphs (Q4242800) (← links)
- Intervalizing k-colored graphs (Q4645169) (← links)
- How to use the minimal separators of a graph for its chordal triangulation (Q4645172) (← links)
- Graph models for PLA folding problems (Q4848447) (← links)
- Memory requirements for table computations in partial k-tree algorithms (Q5054858) (← links)
- The pathwidth and treewidth of cographs (Q5056112) (← links)
- A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
- The interval order polytope of a digraph (Q5101405) (← links)
- (Q5874536) (← links)
- A 3-approximation for the pathwidth of Halin graphs (Q5898649) (← links)
