subject:(graph distances)

Washington State University

1. [No author]. Feature extraction from network data .

Degree: 2019, Washington State University

► This work explores different approaches to feature extraction from network data. The first part focuses on Boolean networks, a simplistic discrete dynamical system built over… (more)

Subjects/Keywords: Applied mathematics; anomaly detection; Boolean networks; computational geometry; graph matching; Gromov–Hausdorff distances; shape analysis

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

author], [. (2019). Feature extraction from network data . (Thesis). Washington State University. Retrieved from http://hdl.handle.net/2376/17893

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

Chicago Manual of Style (16^th Edition):

author], [No. “Feature extraction from network data .” 2019. Thesis, Washington State University. Accessed January 19, 2021. http://hdl.handle.net/2376/17893.

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

MLA Handbook (7^th Edition):

author], [No. “Feature extraction from network data .” 2019. Web. 19 Jan 2021.

Vancouver:

author] [. Feature extraction from network data . [Internet] [Thesis]. Washington State University; 2019. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/2376/17893.

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

Council of Science Editors:

author] [. Feature extraction from network data . [Thesis]. Washington State University; 2019. Available from: http://hdl.handle.net/2376/17893

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

University of Colorado

2. Monnig, Nathan D. From Nonlinear Embedding to Graph Distances: A Spectral Perspective.

Degree: PhD, Applied Mathematics, 2015, University of Colorado

URL: https://scholar.colorado.edu/appm_gradetds/64

► In this thesis, we explore applications of spectral graph theory to the analysis of complex datasets and networks. We consider spectral embeddings of general… (more)

Subjects/Keywords: effective resistance; graph distances; graph theory; nonlinear dimension reduction; radial basis functions; spectral algorithms; Numerical Analysis and Computation; Set Theory

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Monnig, N. D. (2015). From Nonlinear Embedding to Graph Distances: A Spectral Perspective. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/64

Chicago Manual of Style (16^th Edition):

Monnig, Nathan D. “From Nonlinear Embedding to Graph Distances: A Spectral Perspective.” 2015. Doctoral Dissertation, University of Colorado. Accessed January 19, 2021. https://scholar.colorado.edu/appm_gradetds/64.

MLA Handbook (7^th Edition):

Monnig, Nathan D. “From Nonlinear Embedding to Graph Distances: A Spectral Perspective.” 2015. Web. 19 Jan 2021.

Vancouver:

Monnig ND. From Nonlinear Embedding to Graph Distances: A Spectral Perspective. [Internet] [Doctoral dissertation]. University of Colorado; 2015. [cited 2021 Jan 19]. Available from: https://scholar.colorado.edu/appm_gradetds/64.

Council of Science Editors:

Monnig ND. From Nonlinear Embedding to Graph Distances: A Spectral Perspective. [Doctoral Dissertation]. University of Colorado; 2015. Available from: https://scholar.colorado.edu/appm_gradetds/64

Universiteit Utrecht

3. Koutsoumpas, I. Intrinsic mesh matching for near-isometric deformations using double-order affinities.

Degree: 2015, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/311174

► Shape matching is among the most basic research fields in digital geometry processing, with applications ranging from industrial design to three-dimensional medical image analysis. Our… (more)

Subjects/Keywords: differential geometry; shape matching; TOSCA dataset; geodesic distances; isometric deformation; shape analysis; nonrigid shape deformation; graph matching

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Koutsoumpas, I. (2015). Intrinsic mesh matching for near-isometric deformations using double-order affinities. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/311174

Chicago Manual of Style (16^th Edition):

Koutsoumpas, I. “Intrinsic mesh matching for near-isometric deformations using double-order affinities.” 2015. Masters Thesis, Universiteit Utrecht. Accessed January 19, 2021. http://dspace.library.uu.nl:8080/handle/1874/311174.

MLA Handbook (7^th Edition):

Koutsoumpas, I. “Intrinsic mesh matching for near-isometric deformations using double-order affinities.” 2015. Web. 19 Jan 2021.

Vancouver:

Koutsoumpas I. Intrinsic mesh matching for near-isometric deformations using double-order affinities. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2021 Jan 19]. Available from: http://dspace.library.uu.nl:8080/handle/1874/311174.

Council of Science Editors:

Koutsoumpas I. Intrinsic mesh matching for near-isometric deformations using double-order affinities. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/311174

4. Bellitto, Thomas. Walks, Transitions and Geometric Distances in Graphs : Marches, Transitions et Distances G´eom´etriques dans les Graphes.

Degree: Docteur es, Informatique, 2018, Bordeaux

URL: http://www.theses.fr/2018BORD0124

►

Cette thèse étudie les aspects combinatoires, algorithmiques et la complexité de problèmes de théorie des graphes, et tout spécialement de problèmes liés aux notions de… (more)

▼

Cette thèse étudie les aspects combinatoires, algorithmiques et la complexité de problèmes de théorie des graphes, et tout spécialement de problèmes liés aux notions de marches, de transitions et de distance dans les graphes. Nous nous intéressons d’abord au problème de traffic monitoring, qui consiste à placer aussi peu de capteurs que possible sur les arcs d’un graphe de façon à pouvoir reconstituer des marches d’objets. La caractérisation d’instances intéressantes dans la pratique nous amène à la notion de transitions interdites, qui renforce le modèle de graphe. Notre travail sur les graphes à transitions interdites comprend aussi l’étude de la notion d’ensemble de transitions connectant, que l’on peut voir comme l’analogue en terme de transitions de la notion d’arbre couvrant. Une partie importante de cette thèse porte sur les graphes géométriques, qui sont des graphes dont les sommets sont des points de l’espace réel et dont les arêtes sont déterminées par les distances géométriques entre les sommets. Ces graphes sont au coeur du célèbre problème de Hadwiger-Nelson et nous sont d’une grande aide dans notre étude de la densité des ensembles qui évitent la distance 1 dans plusieurs types d’espaces normés. Nous développons des outils pour étudier ces problèmes et les utilisons pour prouver la conjecture de Bachoc-Robins sur plusieurs paralléloèdres. Nous nous penchons aussi sur le cas du plan euclidien et améliorons les bornes sur la densité des ensembles évitant la distance 1 et sur son nombre chromatique fractionnaire. Enfin, nous étudions la complexité de problèmes d’homomorphismes de graphes et établissons des théorèmes de dichotomie sur la complexité des homomorphismes localement injectifs vers les tournois réflexifs.

This thesis studies combinatorial, algorithmic and complexity aspects of graph theory problems, and especially of problems related to the notions of walks, transitions and distances in graphs. We first study the problem of traffic monitoring, in which we have to place as few censors as possible on the arcs of a graph to be able to retrace walks of objects. The characterization of instances of practical interests brings us to the notion of forbidden transitions, which strengthens the model of graphs. Our work on forbidden-transition graphs also includes the study of connecting transition sets, which can be seen as a translation to forbidden-transition graphs of the notion of spanning trees. A large part of this thesis focuses on geometric graphs, which are graphs whose vertices are points of the real space and whose edges are determined by geometric distance between the vertices. This graphs are at the core of the famous Hadwiger- Nelson problem and are of great help in our study of the density of sets avoiding distance 1 in various normed spaces. We develop new tools to study these problems and use them to prove the Bachoc-Robins conjecture on several parallelohedra. We also investigate the case of the Euclidean plane and improve the bounds on the density of sets avoiding distance 1 and on…

Advisors/Committee Members: Pêcher, Arnaud (thesis director), Bachoc, Christine (thesis director).

Subjects/Keywords: Graphes; Marches; Transitions interdites; Homomorphismes de graphes; Nombre de stabilité; Distances géometriques; Ensemble évitant la distance 1; NP-complétude; Graphs; Walks; Forbidden transitions; Graph homomorphisms; Independence number; Geometric distances; Sets avoiding distance 1; NP-completeness

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Bellitto, T. (2018). Walks, Transitions and Geometric Distances in Graphs : Marches, Transitions et Distances G´eom´etriques dans les Graphes. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2018BORD0124

Chicago Manual of Style (16^th Edition):

Bellitto, Thomas. “Walks, Transitions and Geometric Distances in Graphs : Marches, Transitions et Distances G´eom´etriques dans les Graphes.” 2018. Doctoral Dissertation, Bordeaux. Accessed January 19, 2021. http://www.theses.fr/2018BORD0124.

MLA Handbook (7^th Edition):

Bellitto, Thomas. “Walks, Transitions and Geometric Distances in Graphs : Marches, Transitions et Distances G´eom´etriques dans les Graphes.” 2018. Web. 19 Jan 2021.

Vancouver:

Bellitto T. Walks, Transitions and Geometric Distances in Graphs : Marches, Transitions et Distances G´eom´etriques dans les Graphes. [Internet] [Doctoral dissertation]. Bordeaux; 2018. [cited 2021 Jan 19]. Available from: http://www.theses.fr/2018BORD0124.

Council of Science Editors:

Bellitto T. Walks, Transitions and Geometric Distances in Graphs : Marches, Transitions et Distances G´eom´etriques dans les Graphes. [Doctoral Dissertation]. Bordeaux; 2018. Available from: http://www.theses.fr/2018BORD0124

5. Ferdjoukh, Adel. Une approche déclarative pour la génération de modèles : A Declarative Approach for Model Generation.

Degree: Docteur es, Informatique, 2016, Montpellier

URL: http://www.theses.fr/2016MONTT325

►

Disposer de données dans le but de valider ou tester une approche ou un concept est d'une importance primordiale dans beaucoup de domaines différents. Malheureusement,… (more)

Subjects/Keywords: Méta-Modèles; Génération de Modèles; Contraintes CSP; Lois de probabilités usuelles; Distances de graphe; Meta-Models; Model Generation; Constraint Programming; Probability distribution; Graph distance

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Ferdjoukh, A. (2016). Une approche déclarative pour la génération de modèles : A Declarative Approach for Model Generation. (Doctoral Dissertation). Montpellier. Retrieved from http://www.theses.fr/2016MONTT325

Chicago Manual of Style (16^th Edition):

Ferdjoukh, Adel. “Une approche déclarative pour la génération de modèles : A Declarative Approach for Model Generation.” 2016. Doctoral Dissertation, Montpellier. Accessed January 19, 2021. http://www.theses.fr/2016MONTT325.

MLA Handbook (7^th Edition):

Ferdjoukh, Adel. “Une approche déclarative pour la génération de modèles : A Declarative Approach for Model Generation.” 2016. Web. 19 Jan 2021.

Vancouver:

Ferdjoukh A. Une approche déclarative pour la génération de modèles : A Declarative Approach for Model Generation. [Internet] [Doctoral dissertation]. Montpellier; 2016. [cited 2021 Jan 19]. Available from: http://www.theses.fr/2016MONTT325.

Council of Science Editors:

Ferdjoukh A. Une approche déclarative pour la génération de modèles : A Declarative Approach for Model Generation. [Doctoral Dissertation]. Montpellier; 2016. Available from: http://www.theses.fr/2016MONTT325

Kent State University

6. Harbart, Robert Allan. Addressing and Distances for Cellular Networks with Holes.

Degree: MS, College of Arts and Sciences / Department of Computer Science, 2009, Kent State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=kent1248031485

► There is still much research in the areas of routing and location updates in cellular communication networks. Given the limited amount of memory and power… (more)

Subjects/Keywords: Computer Science; communication; network; graph; routing; addressing; distances; shortest; path; hexagonal; triangular

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Harbart, R. A. (2009). Addressing and Distances for Cellular Networks with Holes. (Masters Thesis). Kent State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=kent1248031485

Chicago Manual of Style (16^th Edition):

Harbart, Robert Allan. “Addressing and Distances for Cellular Networks with Holes.” 2009. Masters Thesis, Kent State University. Accessed January 19, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=kent1248031485.

MLA Handbook (7^th Edition):

Harbart, Robert Allan. “Addressing and Distances for Cellular Networks with Holes.” 2009. Web. 19 Jan 2021.

Vancouver:

Harbart RA. Addressing and Distances for Cellular Networks with Holes. [Internet] [Masters thesis]. Kent State University; 2009. [cited 2021 Jan 19]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1248031485.

Council of Science Editors:

Harbart RA. Addressing and Distances for Cellular Networks with Holes. [Masters Thesis]. Kent State University; 2009. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1248031485

7. Planche, Léo. Décomposition de graphes en plus courts chemins et en cycles de faible excentricité : Modélisation structurée et reconnaissance des actions humaines dans les vidéos.

Degree: Docteur es, Mathématiques informatique, 2018, Sorbonne Paris Cité

URL: http://www.theses.fr/2018USPCB224

►

En collaboration avec des chercheurs en biologie à Jussieu, nous étudions des graphes issus de données biologiques afin de d'en améliorer la compréhension. Ces graphes… (more)

▼

En collaboration avec des chercheurs en biologie à Jussieu, nous étudions des graphes issus de données biologiques afin de d'en améliorer la compréhension. Ces graphes sont constitués à partir de fragments d'ADN, nommés reads. Chaque read correspond à un sommet, et deux sommets sont reliés si les deux séquences d'ADN correspondantes ont un taux de similarité suffisant. Ainsi se forme des graphes ayant une structure bien particulière que nous nommons hub-laminaire. Un graphe est dit hub-laminaire s'il peut être résumé en quelques plus courts chemins dont tous les sommets du graphe soient proche. Nous étudions en détail le cas où le graphe est composé d'un unique plus court chemin d'excentricité faible, ce problème a été initialement défini par Dragan 2017. Nous améliorons la preuve d'un algorithme d'approximation déjà existant et en proposons un nouveau, effectuant une 3-approximation en temps linéaire. De plus, nous analysons le lien avec le problème de k-laminarité défini par Habib 2016, ce dernier consistant en la recherche d'un diamètre de faible excentricité. Nous étudions ensuite le problème du cycle isométrique de plus faible excentricité. Nous montrons que ce problème est NP-complet et proposons deux algorithmes d'approximations. Nous définissons ensuite précisément la structure "hub-laminaire" et présentons un algorithme d'approximation en temps O(nm). Nous confrontons cet algorithme à des graphes générés par une procédure aléatoire et l'appliquons à nos données biologiques. Pour finir nous montrons que le calcul du cycle isométrique d'excentricité minimale permet le plongement d'un graphe dans un cercle avec une distorsion multiplicative faible. Le calcul d'une décomposition hub-laminaire permet quant à lui une représentation compacte des distances avec une distorsion additive bornée.

In collaboration with reserchears in biology at Université Pierre et Marie Curie, we study graphs coming from biological data in order to improve our understanding of it. Those graphs come from DNA fragments, named reads. Each read is a vertex and two vertices are linked if the DNA sequences are similar enough. Such graphs have a particuliar structure that we name hub-laminar. A graph is said to be hub-laminar if it may be represented as a (small) set of shortest paths such that every vertex of the graph is close to one of those paths. We first study the case where the graph is composed of an unique shortest path of low eccentricity. This problem was first definied by Dragan 2017. We improve the proof of an approximation algorithm already existing and propose a new one, a 3-approximation running in linear time. Furthermore we show its link with the k-laminar problem defined by Habib 2016, consisting in finding a diameter of low eccentricity. We then define and study the problem of the isometric cycle of minimal eccentricity. We show that this problem is NP-complete and propose two approximation algorithms. We then properly define what is an hub-laminar decomposition and we show an approximation algorithm running in O(nm). We…

Advisors/Committee Members: Birmelé, Étienne (thesis director).

Subjects/Keywords: Théorie des graphes; Cycle isométrique; Excentricité; Plus court chemin; Domination; Graphe de reads; Label de distances; Laminaire; Graph theory; Isometric cycle; Eccentricity; Shortest path; Domination; Read graphs; Distance labeling; Laminarity; 511.5

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Planche, L. (2018). Décomposition de graphes en plus courts chemins et en cycles de faible excentricité : Modélisation structurée et reconnaissance des actions humaines dans les vidéos. (Doctoral Dissertation). Sorbonne Paris Cité. Retrieved from http://www.theses.fr/2018USPCB224

Chicago Manual of Style (16^th Edition):

Planche, Léo. “Décomposition de graphes en plus courts chemins et en cycles de faible excentricité : Modélisation structurée et reconnaissance des actions humaines dans les vidéos.” 2018. Doctoral Dissertation, Sorbonne Paris Cité. Accessed January 19, 2021. http://www.theses.fr/2018USPCB224.

MLA Handbook (7^th Edition):

Planche, Léo. “Décomposition de graphes en plus courts chemins et en cycles de faible excentricité : Modélisation structurée et reconnaissance des actions humaines dans les vidéos.” 2018. Web. 19 Jan 2021.

Vancouver:

Planche L. Décomposition de graphes en plus courts chemins et en cycles de faible excentricité : Modélisation structurée et reconnaissance des actions humaines dans les vidéos. [Internet] [Doctoral dissertation]. Sorbonne Paris Cité; 2018. [cited 2021 Jan 19]. Available from: http://www.theses.fr/2018USPCB224.

Council of Science Editors:

Planche L. Décomposition de graphes en plus courts chemins et en cycles de faible excentricité : Modélisation structurée et reconnaissance des actions humaines dans les vidéos. [Doctoral Dissertation]. Sorbonne Paris Cité; 2018. Available from: http://www.theses.fr/2018USPCB224

Georgia Tech

8. Das Sarma, Atish. Algorithms for large graphs.

Degree: PhD, Computing, 2010, Georgia Tech

URL: http://hdl.handle.net/1853/34709

Subjects/Keywords: Random walks; Distances; Distributed computing; Graphs; PageRank; Distributed algorithms; Online algorithms; Streaming algorithms; Algorithms; Electronic data processing Distributed processing; Parallel algorithms; Graph algorithms; Computer algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Das Sarma, A. (2010). Algorithms for large graphs. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/34709

Chicago Manual of Style (16^th Edition):

Das Sarma, Atish. “Algorithms for large graphs.” 2010. Doctoral Dissertation, Georgia Tech. Accessed January 19, 2021. http://hdl.handle.net/1853/34709.

MLA Handbook (7^th Edition):

Das Sarma, Atish. “Algorithms for large graphs.” 2010. Web. 19 Jan 2021.

Vancouver:

Das Sarma A. Algorithms for large graphs. [Internet] [Doctoral dissertation]. Georgia Tech; 2010. [cited 2021 Jan 19]. Available from: http://hdl.handle.net/1853/34709.

Council of Science Editors:

Das Sarma A. Algorithms for large graphs. [Doctoral Dissertation]. Georgia Tech; 2010. Available from: http://hdl.handle.net/1853/34709

9. Van Langelaar, C.M. (author). Measure, understand and improve cities: Visualizing pedestrian flows to improve inner-city quality in Delft using GPS-tracking technology.

Degree: 2011, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:88e9ff01-8a67-4d31-9aa8-420d769661e0

► We all have walked on a street when suddenly someone comes over to you asking for directions. Sometimes, people do not know where they are… (more)

▼ We all have walked on a street when suddenly someone comes over to you asking for directions. Sometimes, people do not know where they are and they do not know how to reach their destination. They are lost. However, people should not depend on others to find their way. The urban fabric should be legible enough to find one’s way. The problem statement of this Master Thesis is that people should wander and stroll through the urban fabric instead of getting lost. Consequently, for the graduation project we zoom in to one of the many aspects of “good public space”, namely the element ‘wayfinding’. What is good public space in relation to pedestrian’s ability to orientate themselves in the historic city centre? The first chapter deals with wayfinding, its definitions, how it is related to the city centre of Delft, environmental psychology and urban economy. The aim of the graduation project is to better understand how people navigate in cities in order to develop recommendations for urban planning and design to make city visits more enjoyable, engaging and involving for pedestrians. The main research question for the graduation project is: “Which strategic spatial design interventions can improve public space for the slow traffic network in order to retain city visitors in the city centre of Delft?” This subject will be solved by answering four sub-research questions: (i) What are criteria for successful public spaces looking at pedestrians walking in city centres? (ii) What is the current quality of the streets and built environment in the city centre of Delft? (iii) Do pedestrians (visitors/tourists, city centre inhabitants and neighbourhood residents) use the public space in the city centre of Delft differently? (iv) How can the criteria for successful public spaces, the analysis of the current situation and the conclusions of how people use the city centre be embedded in strategic spatial (navigational) recommendations for the city centre of Delft? Applied methods in order to answer the sub-research questions are: (ad i) Literature review studies (a general study about good public space and a specific wayfinding study). (ad ii) Evaluation of the city centre by mapping urban facilities, making a Three-Step analysis, measuring walking distances from two garages, visibility graph analysis, history of Delft by a morphology analysis, quality analysis perception of the city centre based on participants’ questionnaires and a visual analysis (photographs). (ad iii) Actual pedestrian movement is gathered and mapped by doing two GPS-tracking research pilots in the city centre of Delft (a) November 2009: following visitors/tourists who park their car in the Phoenix or Zuidpoort garage and who continue their journey on foot (b) April/May 2010: following city centre inhabitants and neighbourhood residents of Delft. Results are mapped in ArcGIS and statistics are made in SPSS and Excel. Behaviour of the three different pedestrian groups is compared, where after results and conclusions are noted. (ad iv) All gathered information is… Advisors/Committee Members: Rooij, R.M. (mentor), Van der Spek, S.C. (mentor), Van Dorst, M.J. (mentor).

Subjects/Keywords: urban environment; historic; city centre; visualisation; pedestrian movement; walking; measuring; understanding; improving; spatial quality; GPS; tracking; good public space; wayfinding; environmental psychology; urban economy; GIS; SPSS; city centre evaluation; urban facilities; three-step analysis; walking distances; visibility graph analysis; quality analysis perception; visual quality analysis; density analysis; used streets; non-used streets; mission; vision; strategy; spatial interventions; BCG-matrix; star; cash cow; question mark; dog

…53 11.4 Walking distances: 400-800m from garages… …55 11.5 Visibility graph analysis… …x28;Van der Spek, 2008-b). Is this the case for Delft as well? The visibility graph…

10 more images…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Van Langelaar, C. M. (. (2011). Measure, understand and improve cities: Visualizing pedestrian flows to improve inner-city quality in Delft using GPS-tracking technology. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:88e9ff01-8a67-4d31-9aa8-420d769661e0

Chicago Manual of Style (16^th Edition):

Van Langelaar, C M (author). “Measure, understand and improve cities: Visualizing pedestrian flows to improve inner-city quality in Delft using GPS-tracking technology.” 2011. Masters Thesis, Delft University of Technology. Accessed January 19, 2021. http://resolver.tudelft.nl/uuid:88e9ff01-8a67-4d31-9aa8-420d769661e0.

MLA Handbook (7^th Edition):

Van Langelaar, C M (author). “Measure, understand and improve cities: Visualizing pedestrian flows to improve inner-city quality in Delft using GPS-tracking technology.” 2011. Web. 19 Jan 2021.

Vancouver:

Van Langelaar CM(. Measure, understand and improve cities: Visualizing pedestrian flows to improve inner-city quality in Delft using GPS-tracking technology. [Internet] [Masters thesis]. Delft University of Technology; 2011. [cited 2021 Jan 19]. Available from: http://resolver.tudelft.nl/uuid:88e9ff01-8a67-4d31-9aa8-420d769661e0.

Council of Science Editors:

Van Langelaar CM(. Measure, understand and improve cities: Visualizing pedestrian flows to improve inner-city quality in Delft using GPS-tracking technology. [Masters Thesis]. Delft University of Technology; 2011. Available from: http://resolver.tudelft.nl/uuid:88e9ff01-8a67-4d31-9aa8-420d769661e0

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations