446 search results - page 52 / 90 » A fast algorithm for computing steiner edge connectivity |
SAC
2000
ACM
13 years 12 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...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
FOCS
1996
IEEE
13 years 11 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
SDM
2010
SIAM
13 years 9 months ago
2010
SIAM
Given large, multi-million node graphs (e.g., FaceBook, web-crawls, etc.), how do they evolve over time? How are they connected? What are the central nodes and the outliers of the...
TIP
2002
13 years 7 months ago
2002
This paper describes the definition and testing of a new type of median filter for images. The topological median filter implements some existing ideas and some new ideas on fuzzy ...