3757 search results - page 317 / 752 » The overlap number of a graph |
158
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
208
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Subgraph patterns are widely used in graph classification, but their effectiveness is often hampered by large number of patterns or lack of discrimination power among individual p...
155
click to vote
ESA
2005
Springer
16 years 6 days ago
2005
Springer
We present an algorithm for finding shortest surface non-separating cycles in graphs embedded on surfaces in O(g3/2 V 3/2 log V + g5/2 V 1/2 ) time, where V is the number of vert...
158
click to vote
MFCS
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
194
click to vote
SMA
2003
ACM
15 years 12 months ago
2003
ACM
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...