Sciweavers

1633 search results - page 158 / 327
» Planar Map Graphs
Sort
View
ICML
2008
IEEE
14 years 11 months ago
The skew spectrum of graphs
The central issue in representing graphstructured data instances in learning algorithms is designing features which are invariant to permuting the numbering of the vertices. We pr...
Risi Imre Kondor, Karsten M. Borgwardt
ASSETS
2006
ACM
14 years 4 months ago
PLUMB: : an interface for users who are blind to display, create, and modify graphs
We demonstrate the most recent version of our system to communicate graphs and relational information to blind users. We have developed a system called exPLoring graphs at UMB (PL...
Matt Calder, Robert F. Cohen, Jessica A. Lanzoni, ...
GD
2004
Springer
14 years 4 months ago
Visual Navigation of Compound Graphs
This paper describes a local update scheme for the algorithm of Sugiyama and Misue (IEEE Trans. on Systems, Man, and Cybernetics 21 (1991) 876–892) for drawing views of compound ...
Marcus Raitner
IPL
2006
153views more  IPL 2006»
13 years 10 months ago
Oriented vertex and arc colorings of outerplanar graphs
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping from V (G) to V (H), that is (x)(y) is an arc in H whenever xy is an arc in G. The orie...
Alexandre Pinlou, Eric Sopena
JCDL
2004
ACM
94views Education» more  JCDL 2004»
14 years 4 months ago
Element matching in concept maps
Concept maps (CM) are informal, semantic, node-link conceptual graphs used to represent knowledge in a variety of applications. Algorithms that compare concept maps would be usefu...
Byron Marshall, Therani Madhusudan