Efficient algorithms for interval graphs and circular‐arc graphs

This publication has 7 references indexed in Scilit:

• An Efficient Test for Circular-Arc Graphs
  SIAM Journal on Computing, 1980
• An Optimal Solution for the Channel-Assignment Problem
  IEEE Transactions on Computers, 1979
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
  Journal of Computer and System Sciences, 1976
• Geometric intersection problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1976
• Algorithms on circular‐arc graphs
  Networks, 1974
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
  SIAM Journal on Computing, 1973
• Wire routing by optimizing channel assignment within large apertures
  Published by Association for Computing Machinery (ACM) ,1971