5100 search results - page 142 / 1020 » The Linear Complexity of a Graph |
79
Voted
CORR
2006
Springer
15 years 20 days ago
2006
Springer
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that -precision graphs are planar for > 1/ 2 and give a dichotomy theorem f...
109
click to vote
UAI
2004
15 years 2 months ago
2004
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. ...
83
Voted
CORR
2002
Springer
15 years 13 days 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...
123
Voted
BMCBI
2010
15 years 23 days 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...
118
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...