4865 search results - page 448 / 973 » The Complexity of Graph Connectivity |
186
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
222
Voted
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
202
click to vote
APPROX
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
162
click to vote
ICPR
2002
IEEE
16 years 8 months ago
2002
IEEE
In this paper, a new graph data structure for 2-D shape representation is proposed. The new structure is called a concavity graph, and is an evolution from the already known "...
168
click to vote
WEA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...