Sciweavers

268 search results - page 26 / 54
» Cleaning Interval Graphs
Sort
View
103
Voted
GD
2005
Springer
15 years 6 months ago
Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one co...
Alice M. Dean, William Evans, Ellen Gethner, Joshu...
92
Voted
JGAA
2007
104views more  JGAA 2007»
15 years 11 days ago
Bar k-Visibility Graphs
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one c...
Alice M. Dean, William Evans, Ellen Gethner, Joshu...
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
15 years 19 days ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
123
Voted
FP
1992
135views Formal Methods» more  FP 1992»
15 years 4 months ago
High Level Specification of I/O in Functional Languages
The interface with the outside world has always been one of the weakest points of functional languages. It is not easy to incorporate I/O without being allowed to do side-effects....
Peter Achten, John H. G. van Groningen, Marinus J....
77
Voted
WSC
2007
15 years 2 months ago
Alternative thread scoring methods in qualitative event graphs
Event Graphs (EGs) and Simulation Graph Models provide a powerful and general modeling framework for discrete event simulation. Qualitative Event Graphs (QEGs) extend the EG frame...
Ricki G. Ingalls, Douglas J. Morrice