• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 759
  • 105
  • 69
  • 58
  • 24
  • 24
  • 16
  • 16
  • 16
  • 16
  • 16
  • 16
  • 14
  • 10
  • 7
  • Tagged with
  • 1395
  • 1395
  • 292
  • 200
  • 154
  • 149
  • 124
  • 122
  • 121
  • 120
  • 119
  • 115
  • 109
  • 107
  • 107
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
81

Space Efficient Visualisation of Large Hierarchies

January 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.
82

Counting combinatorial structures in recursively constructible graphs /

Leung, Yiu-cho. January 2007 (has links)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2007. / Includes bibliographical references (leaves 121-126). Also available in electronic version.
83

Knowledge representation in mathematics : a case study in graph theory /

Epstein, Susan Lynn. January 1983 (has links)
Thesis (Ph. D.)--Rutgers University, 1983. / Includes bibliographical references (p. 271-274).
84

Bounding the number of graphs containing very long induced paths /

Butler, Steven Kay, January 2003 (has links) (PDF)
Thesis (M.S.)--Brigham Young University. Dept. of Mathematics, 2003. / Includes bibliographical references (p. 32).
85

Sandwich theorem and calculation of the theta function for several graphs /

Riddle, Marcia Ling, January 2003 (has links) (PDF)
Thesis (M.S.)--Brigham Young University. Dept. of Mathematics, 2003. / Includes bibliographical references (p. 31).
86

Asymptotic behavior of combinatorial optimization and proximity graphs on random point sets /

Rose, Daniel John, January 2000 (has links)
Thesis (Ph. D.)--Lehigh University, 2000. / Includes vita. Includes bibliographical references (leaves 142-147).
87

Almost regular graphs and edge-face colorings of plane graphs

Macon, Lisa Fischer. January 2009 (has links)
Thesis (Ph.D.)--University of Central Florida, 2009. / Adviser: Yue Zhao. Includes bibliographical references (p. 102-104).
88

On potentially (K₄--e)-graphic sequences

Niu, Jianbing. January 1900 (has links)
Thesis (M.S.)--West Virginia University, 2002. / Title from document title page. Document formatted into pages; contains iii, 27 p. Includes abstract. Includes bibliographical references (p. 26-27).
89

Generalized nowhere zero flow

Chen, Jingjing. January 1900 (has links)
Thesis (M.S.)--West Virginia University, 2003. / Title from document title page. Document formatted into pages; contains iii, 34 p. : ill. Includes abstract. Includes bibliographical references (p. 33-34).
90

Minimal realization of RC one-port.

Ho, Ka-leung. January 1973 (has links)
Thesis (M. Phil.)--University of Hong Kong, 1973. / Mimeographed.

Page generated in 0.0362 seconds