Pages that link to "Item:Q1116705"
From MaRDI portal
The following pages link to Linear time algorithms for NP-hard problems restricted to partial k- trees (Q1116705):
Displaying 50 items.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- Outer 1-planar graphs (Q289919) (← links)
- An asymptotic analysis of labeled and unlabeled \(k\)-trees (Q308942) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- The disjoint paths problem in quadratic time (Q412168) (← links)
- Tree-width of hypergraphs and surface duality (Q414640) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- On switching classes, NLC-width, cliquewidth and treewidth (Q418754) (← links)
- On shortest disjoint paths in planar graphs (Q429668) (← links)
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Coloring graphs characterized by a forbidden subgraph (Q476308) (← links)
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
- On the max min vertex cover problem (Q499339) (← links)
- A new graph construction of unbounded clique-width (Q509276) (← links)
- Hardness of computing clique number and chromatic number for Cayley graphs (Q518185) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
- On the queue-number of graphs with bounded tree-width (Q521397) (← links)
- Peptide sequencing via graph path decomposition (Q528747) (← links)
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
- Algorithms for finding an induced cycle in planar graphs (Q653839) (← links)
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- Efficient sets in partial \(k\)-trees (Q686252) (← links)
- Computing residual connectedness reliability for restricted networks (Q686266) (← links)
- Tutte polynomials computable in polynomial time (Q686299) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Girth and treewidth (Q707020) (← links)
- The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Nonempty intersection of longest paths in series-parallel graphs (Q729758) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- List matrix partitions of chordal graphs (Q817772) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees (Q834895) (← links)
- Parameterized dominating set problem in chordal graphs: Complexity and lower bound (Q839675) (← links)
- On the structure of contractible edges in \(k\)-connected partial \(k\)-trees (Q844219) (← links)
- Linear-time algorithms for problems on planar graphs with fixed disk dimension (Q845887) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
- On the complexity of the regenerator location problem treewidth and other parameters (Q896670) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Partitioning graphs of supply and demand (Q967306) (← links)
- Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (Q967316) (← links)
