Results 1 -
4 of
4
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
, 2007
"... ..."
Computing and extracting minimal cograph completions in linear time
, 2007
"... Computing and extracting minimal cograph completions in linear time ā ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Computing and extracting minimal cograph completions in linear time ā
Characterizing and computing minimal cograph completions ā
"... A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called minimal if the set of edges added to G is inclusion minimal. In this paper we present two results on minimal cograph completions. The first is a a characterization that allow ..."
Abstract
- Add to MetaCart
A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called minimal if the set of edges added to G is inclusion minimal. In this paper we present two results on minimal cograph completions. The first is a a characterization that allows us to check in linear time whether a given cograph completion is minimal. The second result is a vertex incremental algorithm to compute a minimal cograph completion H of an arbitrary input graph G in O(|V (H) | + |E(H)|) time. 1
