Blar i Department of Informatics på emneord "Interval graphs"
Viser treff 1-1 av 1
-
Largest chordal and interval subgraphs faster than 2n
(Peer reviewed; Journal article, 2015-08-22)We prove that in a graph with n vertices, induced chordal and interval subgraphs with the maximum number of vertices can be found in time O(2λn) for some λ< 1. These are the first algorithms breaking the trivial 2nnO(1) ...