Documents
-
- Download
- Title Pages_Contents
- open access
-
- Download
- Part I: Chapter 2
- open access
- Full text at publishers site
-
- Download
- Part I: Chapter 3
- open access
- Full text at publishers site
-
- Download
- Part I: Chapter 4
- open access
-
- Download
- Part I: Chapter 5
- open access
- Full text at publishers site
-
- Download
- Part I: Chapter 6
- open access
-
- Download
- Part II: Chapter 7
- open access
-
- Download
- Part II: Chapter 8
- open access
- Full text at publishers site
-
- Download
- Bibliography
- open access
-
- Download
- Summary in Dutch
- open access
-
- Download
- Propositions
- open access
In Collections
This item can be found in the following collections:
Algorithms for Analyzing and Mining Real-World Graphs
This thesis is about algorithms for analyzing large real-world graphs (or networks). Examples include (online) social networks, webgraphs, information networks, biological networks and scientific collaboration and citation networks. Although these graphs differ in terms of what kind of information the objects and relationships represent, it turns out that the structure of each these networks is surprisingly similar.For computer scientists, there is an obvious challenge to design efficient algorithms that allow large graphs to be processed and analyzed in a practical setting, facing the challenges of processing millions of nodes and billions of edges. Specifically, there is an opportunity to exploit the non-random structure of real-world graphs to efficiently compute or approximate various properties and measures that would be too hard to compute using traditional graph algorithms. Examples include computation of node-to-node distances and...
Show moreThis thesis is about algorithms for analyzing large real-world graphs (or networks). Examples include (online) social networks, webgraphs, information networks, biological networks and scientific collaboration and citation networks. Although these graphs differ in terms of what kind of information the objects and relationships represent, it turns out that the structure of each these networks is surprisingly similar.For computer scientists, there is an obvious challenge to design efficient algorithms that allow large graphs to be processed and analyzed in a practical setting, facing the challenges of processing millions of nodes and billions of edges. Specifically, there is an opportunity to exploit the non-random structure of real-world graphs to efficiently compute or approximate various properties and measures that would be too hard to compute using traditional graph algorithms. Examples include computation of node-to-node distances and extreme distance measures such as the exact diameter and radius of a graph.
Show less- All authors
- Takes, F.W.
- Supervisor
- Kok, J.N.
- Co-supervisor
- Kosters, W.A.
- Qualification
- Doctor (dr.)
- Awarding Institution
- Leiden Institute of Advanced Computer Science (LIACS), Faculty of Sciences, Leiden University
- Date
- 2014-11-19
- ISBN (print)
- 9789053359570
Funding
- Sponsorship
- NWO