Sciweavers

3105 search results - page 203 / 621
» The Path-Packing Structure of Graphs
Sort
View
ICCS
2004
Springer
15 years 9 months ago
Clustering of Conceptual Graphs with Sparse Data
This paper gives a theoretical framework for clustering a set of conceptual graphs characterized by sparse descriptions. The formed clusters are named in an intelligible manner thr...
Jean-Gabriel Ganascia, Julien Velcin
GD
1998
Springer
15 years 8 months ago
Algorithmic Patterns for Orthogonal Graph Drawing
Abstract. In this paper, we present an object-oriented design and implementation of the core steps of the giotto algorithm for orthogonal graph drawing. Our design is motivated by ...
Natasha Gelfand, Roberto Tamassia
ESA
2008
Springer
127views Algorithms» more  ESA 2008»
15 years 5 months ago
The Alcuin Number of a Graph
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...
Péter Csorba, Cor A. J. Hurkens, Gerhard J....
VIP
2000
15 years 5 months ago
A Graph Based Model for Navigating Visualisation
This paper presents a model for describing visualisation by considering individual parts of an instance and relating them to each other. The resulting part-relationship structure ...
Rajehndra Nagappan
AML
2010
98views more  AML 2010»
15 years 3 months ago
Small universal families for graphs omitting cliques without GCH
When no single universal model for a set of structures exists at a given cardinal, then one may ask in which models of set theory does there exist a small family which embeds the r...
Katherine Thompson