"Finding the Most Relevant Fragments in Networks."

Kevin Buchin et al. (2010)

> Home

Details and statistics

DOI: 10.7155/JGAA.00209

access: open

type: Journal Article

metadata version: 2022-07-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jgaa/BuchinCGLLRSSW10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgaa/BuchinCGLLRSSW10
Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle:
Finding the Most Relevant Fragments in Networks. J. Graph Algorithms Appl. 14(2): 307-336 (2010)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.