Sciweavers

399 search results - page 23 / 80
» The sandwich line graph
Sort
View
GD
2005
Springer
14 years 2 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...
JGAA
2007
104views more  JGAA 2007»
13 years 8 months 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...
SPLC
2010
13 years 7 months ago
Improving the Testing and Testability of Software Product Lines
Abstract. Software Product Line (SPL) engineering offers several advantages in the development of families of software products. There is still a need, however, for better underst...
Isis Cabral, Myra B. Cohen, Gregg Rothermel
FOCS
2009
IEEE
14 years 3 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
WG
2005
Springer
14 years 2 months ago
On Stable Cutsets in Claw-Free Graphs and Planar Graphs
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...
Van Bang Le, Raffaele Mosca, Haiko Müller