Sciweavers

691 search results - page 81 / 139
» Non-negative graph embedding
Sort
View
COCOON
1999
Springer
14 years 10 days ago
An External Memory Data Structure for Shortest Path Queries
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
David A. Hutchinson, Anil Maheshwari, Norbert Zeh
EJC
2008
13 years 8 months ago
Labeled posets are universal
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorph...
Erkko Lehtonen
CALCO
2009
Springer
141views Mathematics» more  CALCO 2009»
14 years 2 months ago
Unfolding Grammars in Adhesive Categories
We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the setting of (single pushout) rewriting over adhesiv...
Paolo Baldan, Andrea Corradini, Tobias Heindel, Ba...
IPPS
2007
IEEE
14 years 2 months ago
An Architectural Framework for Automated Streaming Kernel Selection
Hardware accelerators are increasingly used to extend the computational capabilities of baseline scalar processors to meet the growing performance and power requirements of embedd...
Nikolaos Bellas, Sek M. Chai, Malcolm Dwyer, Dan L...
GD
2009
Springer
14 years 20 days ago
Upward Planarization Layout
Recently, we have presented a new practical method for upward crossing minimization [4], which clearly outperformed existing approaches for drawing hierarchical graphs in that resp...
Markus Chimani, Carsten Gutwenger, Petra Mutzel, H...