3105 search results - page 326 / 621 » The Path-Packing Structure of Graphs |
149
click to vote
SIGSOFT
2003
ACM
16 years 5 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...
142
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
The widespread availability of digital cameras and ubiquitous Internet access have facilitated the creation of massive image collections. These collections can be highly interconn...
139
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
132
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Graph based semi-supervised learning methods (SSL) implicitly assume that the intrinsic geometry of the data points can be fully specified by an Euclidean distance based local ne...
169
click to vote
SLS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...