BibSonomy

The blue social bookmark and publication sharing system.

( en | de | ru )

 

tag
  • tag
  • user
  • group
  • author
  • concept
  • BibTeX key
  • search
  • sign in
  • register
  • groups
  • genealogy
  • popular 
    • posts
    • tags
    • authors
    • concepts
    • discussions
  • sign in
  • register

Login

Log in with your username.

@

I've lost my password.


Log in with your OpenID-Provider.

  • Other OpenID-Provider
  1. tag
  2. 05c85-graph-algorithms 68r10-computer-science-graph-theory

Publication title

bookmarks  (hide)
  • display
  • all
  • bookmarks only
  • bookmarks per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • sort by
  • added at
  • title
  • RSS
  • BibTeX
  • XML

    No matching posts.
  • ⟨⟨
  • ⟨
  • ⟩
  • ⟩⟩

publications  (hide)2  
  • display
  • all
  • publications only
  • publications per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • sort by
  • added at
  • title
  • author
  • publication date
  • entry type
  • help for advanced sorting...
  • RSS
  • BibTeX
  • RDF
  • more...

  •  

     
    1Graph Algorithms : practical examples in Apache Spark and Neo4j
     

    M. Needham, and A. Hodler. O'Reilly, Sebastopol, California, (2019)
    2 months ago by @gdmcbain
    show all tags
    • 05c85-graph-algorithms
    • 68r10-computer-science-graph-theory
     
      05c85-graph-algorithms68r10-computer-science-graph-theory
      (0)
      copydeleteadd this publication to your clipboard
      • community post
      • history of this post
      • URL
      • DOI
      • BibTeX
      • EndNote
      • APA
      • Chicago
      • DIN 1505
      • Harvard
      • MSOffice XML
       
       
    •  

       
      5A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
       

      G. Karypis, and V. Kumar. SIAM Journal on Scientific Computing, 20 (1): 359--392 (January 1998)
      6 years ago by @gdmcbain
      show all tags
      • 05c70-factorization-matching-partitioning
      • 05c85-graph-algorithms
      • 68r10-computer-science-graph-theory
       
        05c70-factorization-matching-partitioning05c85-graph-algorithms68r10-computer-science-graph-theory
        (0)
        copydeleteadd this publication to your clipboard
        • community post
        • history of this post
        • URL
        • DOI
        • BibTeX
        • EndNote
        • APA
        • Chicago
        • DIN 1505
        • Harvard
        • MSOffice XML
         
         
      • ⟨⟨
      • ⟨
      • 1
      • ⟩
      • ⟩⟩

      browse

      related tags

      • + | 05c70-factorization-matching-partitioning
      What is BibSonomy?
      Getting Started
      Browser Buttons
      Help
      Developer
      Overview
      API Documentation
      Contact & Privacy
      Contact
      Privacy & Terms of Use
      Cookies
      Report Issues
      BibSonomy Wiki
      Integration
      PUMA
      TYPO3 Extension
      WordPress Plugin
      Java REST Client
      Supported Sites
      more
      About BibSonomy
      Team
      Blog
      Mailing List
      Social Media
       Follow us on Twitter

      BibSonomy is offered by the Data Science Chair of the University of Würzburg, the Information Processing and Analytics Group of the Humboldt-Unversität zu Berlin, the KDE Group of the University of Kassel, and the L3S Research Center.