1105 search results - page 72 / 221 » Linear choosability of graphs |
140
click to vote
SIAMDM
2002
15 years 3 months ago
2002
Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. Combinatorial reductions are used to derive a second order, linear homogeneous differential equation with polyno...
136
click to vote
PVLDB
2010
15 years 2 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, ...
141
Voted
NETWORKS
2006
15 years 4 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...
105
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
—We motivate the problem of designing a subset of the edge weights in a graph, to shape the spectrum of an associated linear time-invariant dynamics. We address a canonical desig...
121
click to vote
AAECC
2007
Springer
15 years 10 months ago
2007
Springer
Given a linear code C, the fundamental problem of trellis decoding is to find a coordinate permutation of C that yields a code C′ whose minimal trellis has the least state-compl...