Sciweavers

1538 search results - page 93 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
COMBINATORICS
2006
109views more  COMBINATORICS 2006»
15 years 1 months ago
The Strongly Regular (45, 12, 3, 3) Graphs
Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with ...
Kris Coolsaet, Jan Degraer, Edward Spence
ACSC
2007
IEEE
15 years 7 months ago
From Graphs to Euclidean Virtual Worlds: Visualization of 3D Electronic Institutions
In this paper we propose an algorithm for automatic transformation of a graph into a 3D Virtual World and its Euclidean map, using the rectangular dualization technique. The nodes...
Sara Drago, Anton Bogdanovych, Massimo Ancona, Sim...
INFOVIS
2002
IEEE
15 years 6 months ago
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
Yehuda Koren, Liran Carmel, David Harel
JCT
2008
81views more  JCT 2008»
15 years 1 months ago
Algebraic characterization of uniquely vertex colorable graphs
Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...
Christopher J. Hillar, Troels Windfeldt
IPPS
2003
IEEE
15 years 6 months ago
Mesh Partitioning: A Multilevel Ant-Colony-Optimization Algorithm
Mesh partitioning is an important problem that has extensive applications in many areas. Multilevel algorithms are a successful class of optimization techniques which addresses th...
Peter Korosec, Jurij Silc, Borut Robic