488 search results - page 37 / 98 » Automorphic Decompositions of Graphs |
130
click to vote
SMA
2003
ACM
15 years 8 months ago
2003
ACM
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrai...
125
click to vote
TCS
2008
15 years 3 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
133
Voted
ACSD
2005
IEEE
15 years 9 months ago
2005
IEEE
Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a...
125
click to vote
NETWORKS
2008
15 years 3 months ago
2008
Minimizing the number of add-drop multiplexers (ADMs) in a unidirectional SONET ring can be formulated as a graph decomposition problem. When traffic requirements are uniform and ...
115
click to vote
CAIP
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. In this paper we propose a new approach to improve electronic editions of literary corpus, providing an efficient estimation of manuscripts pages structure. In any handwr...