Concepedia

Distance- $$d$$ independent set problems for bipartite and chordal graphs

Hiroshi Eto, Fengrui Guo, Eiji Miyano

Journal of Combinatorial Optimization · 2013 · 31 citations · 14 references

DOI

Concepts

References

14

Some simplified NP-complete graph problems

M. R. Garey, David S. Johnson, Larry Stockmeyer · Theoretical Computer Science · 1976 · 2.1K citations

, , +11

Fixed-parameter tractability and completeness II: On completeness for W[1]

Rod Downey, Michael R. Fellows · Theoretical Computer Science · 1995 · 587 citations

, , +7

Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

Fǎnicǎ Gavril · SIAM Journal on Computing · 1972 · 536 citations

, , +11

On maximal independent sets of vertices in claw-free graphs

George J. Minty · Journal of Combinatorial Theory Series B · 1980 · 466 citations

, , +8

Algorithms on circular‐arc graphs

Fǎnicǎ Gavril · Networks · 1974 · 168 citations

, , +13