205 search results - page 36 / 41 » Pruning 2-Connected Graphs |
ECAI
2008
Springer
13 years 10 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
DMIN
2006
13 years 9 months ago
2006
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
CASCON
1996
13 years 9 months ago
1996
This paper1 describes an algorithm for testing polymorphic interactions between classes in object-oriented (O-O) software. We propose an Augmented Object Relationship Diagram (AOR...
TMI
2008
13 years 8 months ago
2008
Abstract-- In this paper, we propose a new method to construct graphical representations of cortical folding patterns by computing skeletons on triangulated cortical surfaces. In o...
IPL
1998
13 years 8 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...