The clique problem for planar graphs

Information Processing Letters

Volumn 13, Issue 4-5, 1981, Pages 131-133

  Papadimitriou, Christos H ^a,b   Yannakakis, Mihalis ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - GRAPH THEORY;

CLIQUE PROBLEM; PLANAR GRAPHS;

COMPUTER PROGRAMMING;

EID: 0019684494     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(81)90041-7     Document Type: Article

References (4)

1. Efficient planarity testing
2. Reducibility among combinatorial problems