Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

Free space optical (FSO) networking is an attractive technology with applications ranging from high capacity military… Expand

Is this relevant?

2007

2007

The degree-constrained minimum spanning tree (dc- MST) problem is of high practical importance. Up to now there are few effective… Expand

Is this relevant?

2007

2007

The minimum spanning tree (MST) of a graph defines the cheapest subset of edges that keeps the graph in one connected component… Expand

Is this relevant?

2006

2006

In this paper, a Lagrangian-based heuristic is proposed for the degree constrained minimum spanning tree problem. The heuristic… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

The fundamental design choices in an evolutionary algorithm (EA) are its representation of candidate solutions and the operators… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

The Degree Constrained Minimum Spanning Tree (DCMST) on a graph is the problem of generating a minimum spanning tree with… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

The representation of candidate solutions and the variation operators are fundamental design choices in an evolutionary algorithm… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper… Expand

Is this relevant?

1997

1997

The degree-constrained spanning tree problem is of high practical importance. Up to now, there are few effective algorithms to… Expand

Is this relevant?

Highly Cited

1980

Highly Cited

1980

Abstract In this paper the problem of a degree-constrained minimum spanning tree (DCMST) is defined. The problem is formulated as… Expand

Is this relevant?