223 search results - page 15 / 45 » On Computing Longest Paths in Small Graph Classes |
103
Voted
GBRPR
2009
Springer
15 years 8 months ago
2009
Springer
The collection of behavior protocols is a common practice in human factors research, but the analysis of these large data sets has always been a tedious and time-consuming process....
109
click to vote
PDPTA
2007
15 years 3 months ago
2007
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
90
Voted
FCT
2005
Springer
15 years 7 months ago
2005
Springer
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
110
click to vote
DLT
2008
15 years 3 months ago
2008
A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computabl...
110
Voted
FSTTCS
2010
Springer
14 years 12 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...