On the restriction of some NP-complete graph problems to permutation graphs

Authors:
Andreas Brandstädt;Dieter Kratsch
Affiliations:
-;-
Venue:
FCT '85 Fundamentals of Computation Theory
Year:
1985

Citing 0
Cited 2

Graph classes with structured neighborhoods and algorithmic applications

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Graph classes with structured neighborhoods and algorithmic applications

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract