Pages that link to "Item:Q839675"
From MaRDI portal
The following pages link to Parameterized dominating set problem in chordal graphs: Complexity and lower bound (Q839675):
Displaying 6 items.
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223) (← links)
- On finding the longest antisymmetric path in directed acyclic graphs (Q477694) (← links)
- Peptide sequencing via graph path decomposition (Q528747) (← links)
- The parallel solution of domination problems on chordal and strongly chordal graphs (Q1331893) (← links)
- On the induced matching problem in Hamiltonian bipartite graphs (Q2059914) (← links)
- Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs (Q2938098) (← links)