Finding the Most Relevant Fragments in Networks

DOI10.7155/jgaa.00209zbMath1215.05180WikidataQ59782311 ScholiaQ59782311MaRDI QIDQ3075611

Günter Rote, Jun Luo, Sergio Cabello, Bettina Speckmann, Maarten Löffler, Kevin Buchin, Joachim Gudmundsson, Rodrigo I. Silveira, Thomas Wolle

Publication date: 16 February 2011

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00209

zbMATH Keywords

geographical analysis; point pattern detection problem on networks

Mathematics Subject Classification ID

05C90: Applications of graph theory

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms