488 search results - page 20 / 98 » Automorphic Decompositions of Graphs |
EJC
2007
13 years 7 months ago
2007
3 We define four families of geometries with as point graph the graph — or its complement — of all elliptic 4 hyperplanes of a given parabolic quadric in any finite 6-dimensi...
SWAT
2004
Springer
14 years 29 days ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
SSDBM
2010
IEEE
13 years 6 months ago
2010
IEEE
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
IAT
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...