Sciweavers

    275 search results - page 2 / 55
    » Component factors with large components in graphs
    Sort
    View
    JMLR
    2012
    194views Programming Languages» more  JMLR 2012»
    Exact Covariance Thresholding into Connected Components for Large-Scale Graphical Lasso
    11 years 11 months ago
    Exact Covariance Thresholding into Connected Components for Large-Scale Graphical Lasso
    Download  www.stanford.edu
    We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter λ. Suppose the sample covariance graph formed by thresholding th...
    Rahul Mazumder, Trevor Hastie
    claim paper
    Read More »
    AIRWEB
    2009
    Springer
    245views Internet Technology» more  AIRWEB 2009»
    Tag spam creates large non-giant connected components
    14 years 3 months ago
    Tag spam creates large non-giant connected components
    Download  www.dai-labor.de
    Spammers in social bookmarking systems try to mimick bookmarking behaviour of real users to gain the attention of other users or search engines. Several methods have been proposed...
    Nicolas Neubauer, Robert Wetzker, Klaus Obermayer
    claim paper
    Read More »
    RSA
    2008
    118views more  RSA 2008»
    The cover time of the giant component of a random graph
    13 years 8 months ago
    The cover time of the giant component of a random graph
    Download  www.math.cmu.edu
    We study the cover time of a random walk on the largest component of the random graph Gn,p. We determine its value up to a factor 1 + o(1) whenever np = c > 1, c = O(ln n). In ...
    Colin Cooper, Alan M. Frieze
    claim paper
    Read More »
    DM
    2007
    149views more  DM 2007»
    Even subgraphs of bridgeless graphs and 2-factors of line graphs
    13 years 8 months ago
    Even subgraphs of bridgeless graphs and 2-factors of line graphs
    Download  www.maths.qmw.ac.uk
    By Petersen’s theorem, a bridgeless cubic multigraph has a 2-factor. H. Fleischner generalised this result to bridgeless multigraphs of minimum degree at least three by showing ...
    Bill Jackson, Kiyoshi Yoshimoto
    claim paper
    Read More »
    JGT
    2007
    99views more  JGT 2007»
    The upper bound of the number of cycles in a 2-factor of a line graph
    13 years 8 months ago
    The upper bound of the number of cycles in a 2-factor of a line graph
    Download  www.is.kochi-u.ac.jp
    Let G be a simple graph with order n and minimum degree at least two. In this paper, we prove that if every odd branch-bond in G has an edge-branch, then its line graph has a 2-fa...
    Jun Fujisawa, Liming Xiong, Kiyoshi Yoshimoto, She...
    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.