1857 search results - page 47 / 372 » Minimum Degree Orderings |
JCO
2011
13 years 5 months ago
2011
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
ICDE
2010
IEEE
14 years 5 months ago
2010
IEEE
— Network clustering enables us to view a complex network at the macro level, by grouping its nodes into units whose characteristics and interrelationships are easier to analyze ...
APPROX
2008
Springer
14 years 23 days ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
ESA
1998
Springer
14 years 3 months ago
1998
Springer
An ordered tree is a tree in which each node's incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The e...
GLOBECOM
2007
IEEE
14 years 5 months ago
2007
IEEE
— In this paper we investigate the diversity order of single-carrier frequency domain equalizers (SC-FDE). Specifically, we look at minimum mean square error (MMSE) linear equal...