5100 search results - page 236 / 1020 » The Linear Complexity of a Graph |
125
Voted
COMGEO
2006
ACM
15 years 20 days ago
2006
ACM
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
100
Voted
ALGORITHMICA
2010
15 years 7 days ago
2010
We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied verte...
87
Voted
JLP
2006
15 years 18 days ago
2006
We present an algorithm for the linearization of hybrid processes modeled in hybrid process algebra (HyPA) and prove its correctness. HyPA is a formalism that is suitable for the ...
111
click to vote
IJCAI
2007
15 years 2 months ago
2007
This paper proposes and develops a new graph-based semi-supervised learning method. Different from previous graph-based methods that are based on discriminative models, our method...
104
Voted
ENDM
2008
15 years 21 days ago
2008
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, whe...