5100 search results - page 19 / 1020 » The Linear Complexity of a Graph |
VISUALIZATION
2000
IEEE
14 years 4 days ago
2000
IEEE
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is co...
IJCNN
2007
IEEE
14 years 2 months ago
2007
IEEE
—A new interactive visualization tool is proposed for textual data mining based on bipartite graph visualization. Applications to three text datasets are presented to show the ca...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving add...