Minimal proper interval completions - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

Minimal proper interval completions


Given an arbitrary graph $G$, we compute a proper interval supergraph $H$ of $G$, such that $H$ is inclusion-minimal for this property. Our algorithm, based on a breadth-first search of the input graph, has a linear time complexity.
No file

Dates and versions

hal-00085565 , version 1 (12-07-2006)


  • HAL Id : hal-00085565 , version 1


Ivan Rapaport, Karol Suchan, Ioan Todinca. Minimal proper interval completions. 2006, To appear. ⟨hal-00085565⟩
32 View
0 Download


Gmail Facebook X LinkedIn More