Efficient algorithms for finding maximum cliques of an overlap graph
From MaRDI portal
Publication:3471882
DOI10.1002/net.3230200203zbMath0695.90093OpenAlexW1969953427MaRDI QIDQ3471882
Toshinobu Kashiwabara, Toshio Fujisawa, Kazuo Nakajima, Sumio Masuda
Publication date: 1990
Published in: Networks (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1903/4483
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)
Related Items
Towards a comprehensive theory of conflict-tolerance graphs, Improved algorithms for largest cardinality 2-interval pattern problem, OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS, Finding maximum cliques in arbitrary and in special graphs, The maximum clique problem, Fast distance multiplication of unit-Monge matrices
Cites Work