106 search results - page 1 / 22 » Characterizing Minimal Interval Completions |
STACS
2007
Springer
13 years 11 months ago
2007
Springer
IPL
2008
13 years 5 months ago
2008
Given an arbitrary graph G = (V, E) and a proper interval graph H = (V, F) with E F we say that H is a proper interval completion of G. The graph H is called a minimal proper inte...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
FAW
2008
Springer
13 years 6 months ago
2008
Springer
MCSS
2006
Springer
13 years 5 months ago
2006
Springer
Abstract Limited capacity of communication channels has brought to the attention of many researchers the analysis of control systems subject to a quantized input set. In some funda...