Sciweavers

2612 search results - page 126 / 523
» Switching Graphs and Their Complexity
Sort
View
TACAS
1997
Springer
105views Algorithms» more  TACAS 1997»
15 years 2 months ago
Graphs in METAFrame: The Unifying Power of Polymorphism
We present a highly polymorphic tool for the construction, synthesis, structuring, manipulation, investigation, and (symbolic) execution of graphs. The exibility of this tool, whic...
Michael von der Beeck, Volker Braun, Andreas Cla&s...
APVIS
2007
14 years 11 months ago
Level-of-detail visualization of clustered graph layouts
The level-of-detail techniques presented in this paper enable a comprehensible interactive visualization of large and complex clustered graph layouts either in 2D or 3D. Implicit ...
Michael Balzer, Oliver Deussen
ACCV
1998
Springer
15 years 2 months ago
Object Recognition by Matching Symbolic Edge Graphs
We present an object recognition system based on symbolic graphs with object corners as vertices and outlines as edges. Corners are determined in a robust way by a multiscale combi...
Tino Lourens, Rolf P. Würtz
CIAC
2010
Springer
262views Algorithms» more  CIAC 2010»
15 years 1 months ago
Graph unique-maximum and conflict-free colorings
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
Panagiotis Cheilaris and Géza Tóth
DATESO
2004
134views Database» more  DATESO 2004»
14 years 11 months ago
Designing Indexing Structure for Discovering Relationships in RDF Graphs
Discovering the complex relationships between entities is one way of benefitting from the Semantic Web. This paper discusses new approaches to implementing -operators into RDF quer...
Stanislav Barton