534 search results - page 38 / 107 » Diameter critical graphs |
ARSCOM
2008
14 years 11 months ago
2008
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...
CDC
2008
IEEE
15 years 5 months ago
2008
IEEE
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
101
click to vote
ISPA
2007
Springer
15 years 5 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
95
Voted
COR
2010
14 years 11 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
127
click to vote
WAW
2010
Springer
14 years 8 months ago
2010
Springer
Large scale real-world network data such as social and information networks are ubiquitous. The study of such social and information networks seeks to find patterns and explain th...