Sciweavers

    2 search results - page 1 / 1
    » Packing triangles in low degree graphs and indifference grap...
    Sort
    View
    DM
    2008
    88views more  DM 2008»
    Packing triangles in low degree graphs and indifference graphs
    13 years 7 months ago
    Packing triangles in low degree graphs and indifference graphs
    Download  www.ime.usp.br
    We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
    Gordana Manic, Yoshiko Wakabayashi
    claim paper
    Read More »
    KDD
    2012
    ACM
    200views Data Mining» more  KDD 2012»
    Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
    11 years 10 months ago
    Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
    Download  www.cs.princeton.edu
    The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
    David F. Gleich, C. Seshadhri
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.