942 search results - page 36 / 189 » Constraints in Graph Drawing Algorithms |
105
Voted
COCOON
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
135
click to vote
CONSTRAINTS
2007
15 years 2 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
117
Voted
CPAIOR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...
128
Voted
KDD
2005
ACM
15 years 8 months ago
2005
ACM
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
145
Voted
VL
2009
IEEE
15 years 9 months ago
2009
IEEE
Euler diagrams form the basis of several visual modelling notations, including statecharts and constraint diagrams. Recently, various techniques for automated Euler diagram drawin...