Finding the Most Relevant Fragments in Networks

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

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

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 analysispoint pattern detection problem on networks

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

This page was built for publication: Finding the Most Relevant Fragments in Networks