1857 search results - page 7 / 372 » Minimum Degree Orderings |
EJC
2010
13 years 9 months ago
2010
3 For d, k N with k 2d, let g(d, k) denote the infimum density of binary4 sequences (xi)iZ {0, 1}Z which satisfy the minimum degree condition d j=1 (xi+j +5
ALGORITHMICA
2004
13 years 9 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
IPL
2007
13 years 9 months ago
2007
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
SAC
2000
ACM
14 years 2 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
DM
2008
13 years 9 months ago
2008
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G from u to v is at least the distance from u to any neighbour of v. We give the ...