1027 search results - page 34 / 206 » Ordered Vertex Partitioning |
114
click to vote
JGAA
2007
15 years 3 months ago
2007
We introduce a new graph drawing convention for 2.5D hierarchical drawings of directed graphs. The vertex set is partitioned both into layers of vertices drawn in parallel planes ...
144
click to vote
ICTAI
2005
IEEE
15 years 8 months ago
2005
IEEE
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
115
click to vote
ASPDAC
2008
ACM
15 years 5 months ago
2008
ACM
In this paper, we propose a new model order reduction approach for large interconnect circuits using hierarchical decomposition and Krylov subspace projection-based model order re...
109
click to vote
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
— Network clustering enables us to view a complex network at the macro level, by grouping its nodes into units whose characteristics and interrelationships are easier to analyze ...
133
click to vote
CCCG
2010
15 years 4 months ago
2010
We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the follo...