Journal of Algorithms
Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters
On treewidth and minimum fill-in of asteroidal triple-free graphs
Ordal'94 Selected papers from the conference on Orders, algorithms and applications
A polynomial approximation algorithm for the minimum fill-in problem
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Minimum fill-in on circle and circular-arc graphs
Journal of Algorithms
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
A practical algorithm for making filled graphs minimal
Theoretical Computer Science
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Treewidth and Minimum Fill-in: Grouping the Minimal Separators
SIAM Journal on Computing
A fully dynamic algorithm for modular decomposition and recognition of cographs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Computing minimal triangulations in time O(nα log n) = o(n2.376)
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
NP-completeness results for edge modification problems
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Interval completion with few edges
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Minimal comparability completions of arbitrary graphs
Discrete Applied Mathematics
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
A Simple Linear Time LexBFS Cograph Recognition Algorithm
SIAM Journal on Discrete Mathematics
Characterizing minimal interval completions towards better understanding of profile and pathwidth
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Minimum fill-in and treewidth of split+ke and split+kv graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Minimal proper interval completions
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Computing treewidth and minimum fill-in for permutation graphs in linear time
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Minimal interval completion through graph exploration
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Minimal split completions of graphs
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Improved exponential-time algorithms for treewidth and minimum fill-in
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
A novel branching strategy for parameterized graph modification problems
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Polynomial time inductive inference of cograph pattern languages from positive data
ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
| Hi-index | 0.04 |
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 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. An extended abstract of the result has been already presented at FAW 2008 [D. Lokshtanov, F. Mancini, C. Papadopoulos, Characterizing and computing minimal cograph completions, in: Proceedings of FAW'08-2nd International Frontiers of Algorithmics Workshop, in: LNCS, vol. 5059, 2008, pp. 147158. [1]].