4865 search results - page 206 / 973 » The Complexity of Graph Connectivity |
122
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
125
click to vote
TOG
2002
15 years 3 months ago
2002
In this paper we present a novel method for creating realistic, controllable motion. Given a corpus of motion capture data, we automatically construct a directed graph called a mo...
122
click to vote
SIAMDM
2010
15 years 2 months ago
2010
Given a connected bipartite graph G, we describe a procedure which enumerates and computes all graphs H (if any) for which there is a direct product factorization G ∼= H × K2. W...
111
click to vote
CORR
2002
Springer
15 years 3 months ago
2002
Springer
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
153
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...