Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 209,921,003 papers from all fields of science

Search

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…

2009

2009

This work presents an evolutionary approach for solving a difficult problem of combinatorial optimization, the DCMST (Degree…

2007

2007

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

Highly Cited

2003

Highly Cited

2003

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

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…

Highly Cited

2000

Highly Cited

2000

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

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…

Highly Cited

1999

Highly Cited

1999

Finding the degree-constrained minimum spanning tree (d-MST) of a graph is a well-studied NP-hard problem of importance in…

1997

1997

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

Highly Cited

1980