Method for drawing intersecting clustered graphs and its application to web ontology language

Conferences in Research and Practice in Information Technology Series

Volumn 60, Issue , 2006, Pages 89-92

  Omote, Hiroki ^a   Sugiyama, Kozo ^a  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Force directed; Graph drawing; Intersecting clustered graph; OWL

Indexed keywords

CLUSTERED GRAPH; FORCE-DIRECTED; GRAPH DRAWING; GRAPH-BASED; ITS APPLICATIONS; OWL; SPRING MODEL; WEB ONTOLOGY LANGUAGE;

DRAWING (GRAPHICS); ONTOLOGY; VISUALIZATION;

DIRECTED GRAPHS;

EID: 84883346648     PISSN: 14451336     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Eades, P. (1984): A Heuristic for Graph Drawing, CONGRESSUSNUMERANTIUM 42, pp.149-160.
2. Eades, P., Feng, Q. and Lin, X. (1996): Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs, LNCS 1027 GD'95 Graph Drawing pp.113-128, Springer-Verlag.
3. Harel, D. (1972): On visual formalism. Comm. ACM 31(5): 514-530.
4. Jena: Jena2 A Semantic Web Framework, http://www.hpl.hp.com/semweb/jena. htm. Accessed 28 Aug. 2005.
5. Kawakita, J. (1986): The KJ method. Tokyo, Chuo-koron-sha. (in Japanese).
6. Sowa, J. F. (1984): Conceptual structures. Addison- Wesley.
7. OWL W3C: OWL Web Ontology Language Reference W3C Recommendation 10 February 2004, http://www.w3.org/TR/owl-ref/Accessed 28 Aug. 2005.