Pages that link to "Item:Q411223"
From MaRDI portal
The following pages link to Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223):
Displaying 5 items.
- On finding the longest antisymmetric path in directed acyclic graphs (Q477694) (← links)
- Peptide sequencing via graph path decomposition (Q528747) (← links)
- Secure total domination in graphs: bounds and complexity (Q1786876) (← links)
- An improved exact algorithm for minimum dominating set in chordal graphs (Q2059888) (← links)
- On the induced matching problem in Hamiltonian bipartite graphs (Q2059914) (← links)
