384 search results - page 20 / 77 » On s-hamiltonian-connected line graphs |
169
click to vote
ACCV
2007
Springer
16 years 25 days ago
2007
Springer
This paper proposes a novel volume-based motion capture method using a bottom-up analysis of volume data and an example topology database of the human body. By using a two-step gra...
172
click to vote
CHI
2009
ACM
16 years 7 months ago
2009
ACM
Graphs are often visualized using node-link representations: vertices are depicted as dots, edges are depicted as (poly)lines connecting two vertices. A directed edge running from...
153
click to vote
GTTSE
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. Feature Models (FMs) are a key artifact for variability and commonality management in Software Product Lines (SPLs). In this context, the merging of FMs is being recogniz...
172
click to vote
COMBINATORICA
2006
15 years 6 months ago
2006
In this paper we show that, if G is a Berge graph such that neither G nor its complement G contains certain induced subgraphs, named proper wheels and long prisms, then either G i...
164
click to vote
CCCG
2010
15 years 8 months ago
2010
In this paper we show how to construct in 2 rounds a line-rigid point placement graph of size 4n/3+O(1) from small graphs called 6:6 jewels, an extension of the 4:4 jewel of [3]. ...