Sciweavers

1722 search results - page 76 / 345
» Variables in Concept Graphs
Sort
View
JCT
2010
112views more  JCT 2010»
14 years 8 months ago
More on block intersection polynomials and new applications to graphs and block designs
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
Leonard H. Soicher
TMRA
2005
Springer
15 years 3 months ago
Collaborative Software Development and Topic Maps
This work-in-progress report subsumes our ongoing research to develop a Topic Maps centric, modularised system which supports collaborative software development by combining the me...
Markus Ueberall, Oswald Drobnik
ICCS
2004
Springer
15 years 3 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
DM
2010
126views more  DM 2010»
14 years 10 months ago
Asymptotic connectivity of hyperbolic planar graphs
We investigate further the concept of asymptotic connectivity as defined previously by the first author. In particular, we compute an upper bound on the asymptotic connectivity of ...
Patrick Bahls, Michael R. Dipasquale
CORR
2004
Springer
121views Education» more  CORR 2004»
14 years 9 months ago
A measure of similarity between graph vertices
We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with, respectively, nA and nB vertices. We define an nB
Vincent D. Blondel, Anahí Gajardo, Maureen ...