9532 search results - page 401 / 1907 » Logic, Graphs, and Algorithms |
177
Voted
ISAAC
2004
Springer
16 years 5 days ago
2004
Springer
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner ...
155
click to vote
WG
2004
Springer
16 years 4 days ago
2004
Springer
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular...
179
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
A new graph reduction approach to symbolic circuit analysis is developed in this paper. A Binary Decision Diagram (BDD) mechanism is formulated, together with a specially designed ...
185
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
180
click to vote
GD
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The GRIP system is designed for drawing large graphs and uses a novel multi-dimensional ...