2503 search results - page 42 / 501 » A study of 3-arc graphs |
197
click to vote
FAW
2007
Springer
15 years 12 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
153
click to vote
WADS
2007
Springer
15 years 12 months ago
2007
Springer
Let G = (S, E) be a plane straight-line graph on a finite point set S ⊂ R2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges ...
157
click to vote
GC
2010
Springer
15 years 3 months ago
2010
Springer
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
186
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
159
click to vote
DAM
1999
15 years 5 months ago
1999
Molecular biology which aims to study DNA and protein structure and functions, has stimulated research in di erent scienti