Author:
Golovach Petr A.,Paulusma Daniël,van Leeuwen Erik Jan
Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. Detecting fixed patterns in chordal graphs in polynomial time;Belmonte;Algorithmica,2014
2. On the complexity of testing for odd holes and induced odd paths;Bienstock;Discrete Math.,1991
3. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms;Booth;J. Comput. System Sci.,1976
4. Graph Theory;Diestel,2005
5. The Robertson–Seymour theorems: a survey of applications;Fellows,1989
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献