441 search results - page 42 / 89 » Convex Graph Invariants |
125
click to vote
GD
2006
Springer
15 years 7 months ago
2006
Springer
We consider graph drawing algorithms for learning spaces, a type of st-oriented partial cube derived from an antimatroid and used to model states of knowledge of students. We show...
150
Voted
DCG
2011
14 years 10 months ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
141
click to vote
PR
2008
15 years 3 months ago
2008
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
IPL
2006
15 years 3 months ago
2006
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...
124
click to vote
DM
2010
15 years 3 months ago
2010
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a given ...