5100 search results - page 200 / 1020 » The Linear Complexity of a Graph |
PVLDB
2010
13 years 9 months ago
2010
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
NETWORKS
2006
13 years 10 months ago
2006
In a bidirected graph, each end of each edge is independently oriented. We show how to express any column of the incidence matrix as a half-integral linear combination of any colum...
TCS
2012
12 years 6 months ago
2012
Abstract. The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large boundeddegree graph whose size is exponential in th...
MOR
2007
13 years 10 months ago
2007
This paper studies the possibilities of the Linear Matrix Inequality (LMI) characterization of the matrix cones formed by nonnegative complex Hermitian quadratic functions over sp...
LATIN
2010
Springer
14 years 5 months ago
2010
Springer
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...