메뉴 건너뛰기




Volumn 2912, Issue , 2004, Pages 381-386

Layout of directed hypergraphs with orthogonal hyperedges

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED HYPERGRAPHS; ELECTRICAL SIGNAL; HYPERGRAPH; LAYOUT ALGORITHMS; MULTIPLE SOURCE; ORTHOGONAL SEGMENTS; SOURCE NODES; TARGET NODES; EXTENDED ABSTRACTS;

EID: 35048860296     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24595-7_35     Document Type: Article
Times cited : (26)

References (11)
  • 2
    • 0024108464 scopus 로고
    • Algorithms for plane representations of acyclic digraphs
    • G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoret. Comput. Sei., 61:175-198, 1988,
    • (1988) Theoret. Comput. Sei. , vol.61 , pp. 175-198
    • Di Battista, G.1    Tamassia, R.2
  • 4
    • 0039556135 scopus 로고
    • Computers and intractability: A guide through the theory of NP-Completeness
    • M. R. Garey and D. S. Johnson. Computers and intractability: A guide through the theory of NP-Completeness. W. H. Freeman, New York, NY, 1979.
    • (1979) W. H. Freeman, New York, NY
    • Garey, M.R.1    Johnson, D.S.2
  • 5
    • 84947931548 scopus 로고    scopus 로고
    • The drawing of configurations
    • Springer, LNCS 1027
    • H. Gropp. The drawing of configurations. In Proc. Symposium on Graph Drawing, GD'95, pages 267-276. Springer, LNCS 1027, 1996.
    • (1996) Proc. Symposium on Graph Drawing, GD'95 , pp. 267-276
    • Gropp, H.1
  • 6
    • 84986517167 scopus 로고
    • Hypergraph planarity and the complexity of drawing venn diagrams
    • D. S. Johnson and H. Pollak. Hypergraph planarity and the complexity of drawing venn diagrams. Journal of Graph Theory, ll(3):309-325, 1987.
    • (1987) Journal of Graph Theory , Issue.3 , pp. 309-325
    • Johnson, D.S.1    Pollak, H.2
  • 9
    • 84947931321 scopus 로고    scopus 로고
    • A fast heuristic for hierarchical Manhattan layout
    • Springer, LNCS 1027
    • G. Sander. A fast heuristic for hierarchical Manhattan layout. In Proc. Symposium on Graph Drawing, GD'95, pages 447-458. Springer, LNCS 1027, 1996.
    • (1996) Proc. Symposium on Graph Drawing, GD'95 , pp. 447-458
    • Sander, G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.