Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Geometrical graph theory). Showing records 1 – 2 of 2 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Hong Kong University of Science and Technology

1. Haleem, Hammad CSE. Evaluating the readability of graph layouts : a deep learning approach.

Degree: 2018, Hong Kong University of Science and Technology

Existing graph layout algorithms are usually not able to optimize all the aesthetic properties desired in a graph layout. To evaluate how well the desired visual features are exhibited in a graph layout, many readability metrics were introduced in the past decade. However, the calculation of these readability metrics often requires access to the node and edge coordinates and is usually computationally inefficient, especially for dense graphs. Importantly, when the node and edge coordinates are not accessible, it becomes impossible to evaluate the graph layouts quantitatively. We propose a novel deep-learning based approach to assess the readability of layouts by directly using graph images. A convolutional neural network architecture is proposed, trained on a benchmark dataset of graph images, which is composed of synthetically-generated and graphs created by sampling from real large networks. The proposed method is quantitatively compared to traditional methods and qualitatively assessed with the help of a case study. This work is a first step towards using deep learning based approach to evaluate images from the visualization field quantitatively.

Subjects/Keywords: Information visualization ; Geometrical drawing ; Graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Haleem, H. C. (2018). Evaluating the readability of graph layouts : a deep learning approach. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-96407 ; https://doi.org/10.14711/thesis-991012636768703412 ; http://repository.ust.hk/ir/bitstream/1783.1-96407/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Haleem, Hammad CSE. “Evaluating the readability of graph layouts : a deep learning approach.” 2018. Thesis, Hong Kong University of Science and Technology. Accessed August 13, 2020. http://repository.ust.hk/ir/Record/1783.1-96407 ; https://doi.org/10.14711/thesis-991012636768703412 ; http://repository.ust.hk/ir/bitstream/1783.1-96407/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Haleem, Hammad CSE. “Evaluating the readability of graph layouts : a deep learning approach.” 2018. Web. 13 Aug 2020.

Vancouver:

Haleem HC. Evaluating the readability of graph layouts : a deep learning approach. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2018. [cited 2020 Aug 13]. Available from: http://repository.ust.hk/ir/Record/1783.1-96407 ; https://doi.org/10.14711/thesis-991012636768703412 ; http://repository.ust.hk/ir/bitstream/1783.1-96407/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Haleem HC. Evaluating the readability of graph layouts : a deep learning approach. [Thesis]. Hong Kong University of Science and Technology; 2018. Available from: http://repository.ust.hk/ir/Record/1783.1-96407 ; https://doi.org/10.14711/thesis-991012636768703412 ; http://repository.ust.hk/ir/bitstream/1783.1-96407/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of North Texas

2. Xuan, Mingzhi. On Steinhaus Sets, Orbit Trees and Universal Properties of Various Subgroups in the Permutation Group of Natural Numbers.

Degree: 2012, University of North Texas

In the first chapter, we define Steinhaus set as a set that meets every isometric copy of another set at exactly one point. We show that there is no Steinhaus set for any four-point subset in a plane.In the second chapter, we define the orbit tree of a permutation group of natural numbers, and further introduce compressed orbit trees. We show that any rooted finite tree can be realized as a compressed orbit tree of some permutation group. In the third chapter, we investigate certain classes of closed permutation groups of natural numbers with respect to their universal and surjectively universal groups. We characterize two-sided invariant groups, and prove that there is no universal group for countable groups, nor universal group for two-sided invariant groups in permutation groups of natural numbers. Advisors/Committee Members: Gao, Su, Jackson, Steve, 1957-, Sari, Bunyamin.

Subjects/Keywords: Geometrical graph theory; topological groups; permutation groups; universal group; descriptive set theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Xuan, M. (2012). On Steinhaus Sets, Orbit Trees and Universal Properties of Various Subgroups in the Permutation Group of Natural Numbers. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc149691/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Xuan, Mingzhi. “On Steinhaus Sets, Orbit Trees and Universal Properties of Various Subgroups in the Permutation Group of Natural Numbers.” 2012. Thesis, University of North Texas. Accessed August 13, 2020. https://digital.library.unt.edu/ark:/67531/metadc149691/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Xuan, Mingzhi. “On Steinhaus Sets, Orbit Trees and Universal Properties of Various Subgroups in the Permutation Group of Natural Numbers.” 2012. Web. 13 Aug 2020.

Vancouver:

Xuan M. On Steinhaus Sets, Orbit Trees and Universal Properties of Various Subgroups in the Permutation Group of Natural Numbers. [Internet] [Thesis]. University of North Texas; 2012. [cited 2020 Aug 13]. Available from: https://digital.library.unt.edu/ark:/67531/metadc149691/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xuan M. On Steinhaus Sets, Orbit Trees and Universal Properties of Various Subgroups in the Permutation Group of Natural Numbers. [Thesis]. University of North Texas; 2012. Available from: https://digital.library.unt.edu/ark:/67531/metadc149691/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.