SCOPUS 정보 검색 플랫폼

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2528 LNCS, Issue , 2002, Pages 98-109

A branch-and-cut approach to the directed acyclic graph layering problem

(2) Healy, Patrick a Nikolov, Nikola S a

a UNIVERSITY OF LIMERICK (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; COMPUTATIONAL COMPLEXITY; DIRECTED GRAPHS; DRAWING (GRAPHICS); ALGORITHMS; GRAPH THEORY; INTEGER PROGRAMMING;

BRANCH AND CUT; BRANCH-AND-BOUND ALGORITHMS; CUTTING PLANES; DIRECTED ACYCLIC GRAPH (DAG); INTEGER LINEAR PROGRAMMING FORMULATION; SEPARATION ALGORITHMS; STANDARD PROBLEMS; VALID INEQUALITY;

INTEGER PROGRAMMING; DIRECTED GRAPHS;

EID: 84867473359 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/3-540-36151-0_10 Document Type: Conference Paper

Times cited : (24)

References (6)

1
- 23044460571
- Layered drawings of digraphs
- M. Kaufman and D. Wagner, editors Springer-Verlag
- O. Bastert and C. Matuszewski. Layered drawings of digraphs. In M. Kaufman and D. Wagner, editors, Drawing Graphs: Method and Models, volume 2025 of LNCS, pages 87-120. Springer-Verlag, 2000.
- (2000) Drawing Graphs: Method and Models, Volume 2025 of LNCS , pp. 87-120
- Bastert, O.¹ Matuszewski, C.²

2
- 0037203617
- Width-restriced layering of acyclic digraphs with consideration of dummy nodes
- January
- J. Branke, S. Leppert, M. Middendorf, and P. Eades. Width-restriced layering of acyclic digraphs with consideration of dummy nodes. Information Processing Letters, 81(2):59-63, January 2002.
- (2002) Information Processing Letters , vol.81 , Issue.2 , pp. 59-63
- Branke, J.¹ Leppert, S.² Middendorf, M.³ Eades, P.⁴

3
- 0025556425
- How to draw a directed graph
- P. Eades and K. Sugiyama. How to draw a directed graph. Journal of Information Processing, 13(4):424-437, 1990.
- (1990) Journal of Information Processing , vol.13 , Issue.4 , pp. 424-437
- Eades, P.¹ Sugiyama, K.²

4
- 84867461110
- How to layer a directed acyclic graph
- P. Mutzel, M. Jünger, and S. Leipert, editors Springer-Verlag
- P. Healy and N. S. Nikolov. How to layer a directed acyclic graph. In P. Mutzel, M. Jünger, and S. Leipert, editors, Graph Drawing: Proceedings of 9th International Symposium, GD 2001, volume 2265 of LNCS, pages 16-30. Springer-Verlag, 2002.
- (2002) Graph Drawing: Proceedings of 9th International Symposium, GD 2001, Volume 2265 of LNCS , pp. 16-30
- Healy, P.¹ Nikolov, N.S.²

5
- 84867442681
- Facets of the directed acyclic graph layering polytope
- Luděk Kučera, editor LNCS. Springer-Verlag, (To appear.)
- P. Healy and N. S. Nikolov. Facets of the directed acyclic graph layering polytope. In Luděk Kučera, editor, Graph Theoretical Concepts in Computer Science: WG2002, LNCS. Springer-Verlag, (To appear.).
- Graph Theoretical Concepts in Computer Science: Wg2002
- Healy, P.¹ Nikolov, N.S.²

6
- 0019530043
- Methods for visual understanding of hierarchical system structures
- February
- K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transaction on Systems, Man, and Cybernetics, 11(2):109-125, February 1981.
- (1981) IEEE Transaction on Systems, Man, and Cybernetics , vol.11 , Issue.2 , pp. 109-125
- Sugiyama, K.¹ Tagawa, S.² Toda, M.³

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