Sciweavers

6740 search results - page 48 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
JGAA
2007
104views more  JGAA 2007»
13 years 7 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 6 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
SWAT
1994
Springer
86views Algorithms» more  SWAT 1994»
13 years 11 months ago
Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
Arvind Gupta, Naomi Nishimura
COMPGEOM
2005
ACM
13 years 9 months ago
Hadwiger and Helly-type theorems for disjoint unit spheres in R3
Let S be an ordered set of disjoint unit spheres in R3 . We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the ent...
Otfried Cheong, Xavier Goaoc, Andreas Holmsen
CORR
2007
Springer
119views Education» more  CORR 2007»
13 years 7 months ago
Hadwiger and Helly-type theorems for disjoint unit spheres
Let S be an ordered set of disjoint unit spheres in R3 . We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the ent...
Otfried Cheong, Xavier Goaoc, Andreas Holmsen, Syl...