Spelling suggestions: "subject:"[een] GRAPH THEORY"" "subject:"[enn] GRAPH THEORY""
41 |
Space Efficient Visualisation of Large HierarchiesJanuary 2005 (has links)
Relational information visualisation concerns viewing relational data, where the underlying data model is a graph. Hierarchical visualisation is one of hot topics in graph visualisation in which the data is organised in a hierarchical structure. As the amount of information, that we want to visualise, becomes larger and the relations become more complex, classical visualisation techniques and hierarchical drawing methods tend to be inadequate.Traditional hierarchical visualisation algorithms are more concerned with the readability of the layouts. They usually do not consider the efficient utilisation of the geometrical plane for the drawings. Therefore, for most hierarchical layouts, a large portion of display space is wasted as background. The aim of this research is to investigate a space-efficient approach to handle the visualisation of large hierarchies in two-dimensional spaces. This thesis introduces a new graph visualisation approach called enclosure+ connection for visualizing large hierarchies. This approach maximises the space utilisation by taking advantages of the traditional enclosure partitioning approach, while it retains the display of a traditional node-link diagram to hopefully provide users a direct perception of relational structures. The main contribution of this thesis is layout and navigation algorithms for visualising large hierarchies. Two layout algorithms, the space-optimised tree and the EncCon tree, have been developed to achieve the space-efficient visualisation. Both algorithms use the enclosure concept to define layout of hierarchies, which ensure the efficient utilisation of display space. Two focus+context navigation and interaction methods have been proposed to cooperate with the visualization of large hierarchies. Several advanced computer graphics approaches, such as graphic distortion and transparency, are used for the development of these navigation methods. Two case studies have been implemented to evaluate the layout algorithms and the associated navigation methods. The first case study is an application of a shared collaborative workspace which aims to provide users with a better assistance for visual manipulation and navigation of knowledge-based information. The second case study is a visual browser for navigating large-scale online product catalogues. Although the case studies have provided some useful evaluation, formal usability studies would be required to justify fully the effectiveness of these layout and navigation methods. Although this task has not carried out in this research, the author has presented his usability study's plan as a future work.
|
42 |
Efficient generation of minimal graphs using independent path analysisHumphrey, Linda S. January 2006 (has links)
Thesis (M.S.)--University of Nevada, Reno, 2006. / "December, 2006." Includes bibliographical references (leaves 49-50). Online version available on the World Wide Web.
|
43 |
A faster algorithm for the single source shortest path problem with few distinct positive lengthsWilliamson, Matthew D. January 2009 (has links)
Thesis (M.S.)--West Virginia University, 2009. / Title from document title page. Document formatted into pages; contains viii, 42 p. : ill. Includes abstract. Includes bibliographical references (p. 41-42).
|
44 |
On straight line representations of random planar graphs /Choi, In-kyeong. January 1991 (has links)
Thesis (Ph. D.)--Oregon State University, 1992. / Typescript (photocopy). Includes bibliographical references (leaves 49-50). Also available on the World Wide Web.
|
45 |
Use of finite random graphs to model packet radio networksWang, Yang. January 1990 (has links)
Thesis (M.S.)--Ohio University, March, 1990. / Title from PDF t.p.
|
46 |
Cycles in graph theory and matroidsZhou, Ju, January 1900 (has links)
Thesis (Ph. D.)--West Virginia University, 2008. / Title from document title page. Document formatted into pages; contains vi, 44 p. : ill. Includes abstract. Includes bibliographical references (p. 42-44).
|
47 |
The triangle intersection problem for hexagon triple systemsPettis, Carl Stuart, 1979- Lindner, Charles C. January 2006 (has links) (PDF)
Dissertation (Ph.D.)--Auburn University, 2006. / Abstract. Vita. Includes bibliographic references (p.79).
|
48 |
Expected lengths of minimum spanning treesZhang, Xinyi. January 2008 (has links)
Thesis (Ph.D.)--University of Delaware, 2008. / Principal faculty advisor: Wenbo Li, Dept. of Mathematical Sciences. Includes bibliographical references.
|
49 |
Intersection numbers of divisors in graph varietiesJones, Deborah. Aluffi, Paolo. January 2003 (has links)
Thesis (Ph. D.)--Florida State University, 2003. / Advisor: Dr. Paolo Aluffi, Florida State University, College of Arts and Sciences, Dept. of Mathematics. Title and description from dissertation home page (viewed Sept. 08, 2004). Includes bibliographical references.
|
50 |
Approximating the circumference of 3-connected claw-free graphsBilinski, Mark. January 2008 (has links)
Thesis (Ph.D)--Mathematics, Georgia Institute of Technology, 2009. / Committee Chair: Yu, Xingxing; Committee Member: Duke, Richard; Committee Member: Tetali, Prasad; Committee Member: Thomas, Robin; Committee Member: Vigoda, Eric. Part of the SMARTech Electronic Thesis and Dissertation Collection.
|
Page generated in 0.046 seconds