Pages that link to "Item:Q5311524"
From MaRDI portal
The following pages link to Parameterized and Exact Computation (Q5311524):
Displaying 14 items.
- Contraction obstructions for connected graph searching (Q298950) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Connected graph searching (Q690489) (← links)
- On minimizing width in linear layouts (Q751660) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
- Lower bounds on the pathwidth of some grid-like graphs (Q2476243) (← links)
- Typical sequences revisited -- computing width parameters of graphs (Q2701067) (← links)
- Mixed search number and linear-width of interval and split graphs (Q3057182) (← links)
- The Linkage of a Graph (Q4887020) (← links)
- A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
- (Q5874536) (← links)
- Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)