836 search results - page 110 / 168 » Orthogonal Colorings of Graphs |
103
click to vote
ISCAPDCS
2004
15 years 3 months ago
2004
This paper addresses the application of distributed constraint optimization problems (DCOPs) to large-scale dynamic environments. We introduce a decomposition of DCOP into a graph...
91
Voted
EJC
2007
15 years 1 months ago
2007
Abstract. Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex ∆A,H as the subdivision of the link of A induced...
139
Voted
SOFTVIS
2010
ACM
15 years 8 days ago
2010
ACM
Reverse engineering methods produce different descriptions of software architectures. In this work we analyze and define the task of exploring and comparing these descriptions. ...
122
click to vote
JGAA
2002
15 years 1 months ago
2002
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
109
click to vote
ACSC
2003
IEEE
15 years 7 months ago
2003
IEEE
Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in ...