204 search results - page 14 / 41 » Testing Triangle-Freeness in General Graphs |
SIGSOFT
2003
ACM
14 years 8 months ago
2003
ACM
Program slicing is a technique to identify statements that may influence the computations at other statements. Precise slicing has been shown to be undecidable for concurrent prog...
AMW
2011
12 years 11 months ago
2011
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
GD
2004
Springer
14 years 29 days ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
BMCBI
2010
13 years 7 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...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
This paper proposes a novel method to apply the standard graph cut technique to segmenting multimodal tensor valued images. The Riemannian nature of the tensor space is explicitly...