Sciweavers

5889 search results - page 67 / 1178
» Graph Layout Problems
Sort
View
PPAM
2007
Springer
14 years 4 months ago
Application of Fusion-Fission to the Multi-way Graph Partitioning Problem
This paper presents an application of the Fusion-Fission method to the multi-way graph partitioning problem. The Fusion-Fission method was first designed to solve the normalized c...
Charles-Edmond Bichot
CORR
2008
Springer
123views Education» more  CORR 2008»
13 years 10 months ago
On the graph isomorphism problem
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is relate...
Shmuel Friedland
WG
2001
Springer
14 years 2 months ago
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs
We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicograph...
Sergei L. Bezrukov, Robert Elsässer
IPPS
1999
IEEE
14 years 2 months ago
A Graph Based Method for Generating the Fiedler Vector of Irregular Problems
In this paper we present new algorithms for spectral graph partitioning. Previously, the best partitioning methods were based on a combination of Combinatorial algorithms and appli...
Michael Holzrichter, Suely Oliveira
PPL
2000
110views more  PPL 2000»
13 years 9 months ago
Faulty Random Geometric Networks
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
Josep Díaz, Jordi Petit, Maria J. Serna