Sciweavers

    4865 search results - page 113 / 973
    » The Complexity of Graph Connectivity
    Sort
    View
    DAM
    1999
    99views more  DAM 1999»
    Recognizing Graphs of Acyclic Cubical Complexes
    13 years 10 months ago
    Recognizing Graphs of Acyclic Cubical Complexes
    Download  www.fmf.uni-lj.si
    Acyclic cubical complexes have first been introduced by Bandelt and Chepoi in analogy to acyclic simplicial complexes. They characterized them by cube contraction and elimination ...
    Wilfried Imrich, Sandi Klavzar
    claim paper
    Read More »
    RIVF
    2003
    128views Internet Technology» more  RIVF 2003»
    Complex Systems Modeling
    13 years 11 months ago
    Complex Systems Modeling
    Download  rivf.e-ifi.org
    —This paper addresses the simulation of the dynamics of complex systems by using hierarchical graph and multi-agent system. A complex system is composed of numerous interacting p...
    Christophe Lecerf, Thi Minh Luan Nguyen
    claim paper
    Read More »
    SIROCCO
    1997
    107views Information Technology» more  SIROCCO 1997»
    Better Expanders and Superconcentrators by Kolmogorov Complexity
    13 years 11 months ago
    Better Expanders and Superconcentrators by Kolmogorov Complexity
    Download  www.uni-ulm.de
    We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual “probabilistic construction”. Also, the best k...
    Uwe Schöning
    claim paper
    Read More »
    RSA
    2000
    104views more  RSA 2000»
    Construction of expanders and superconcentrators using Kolmogorov complexity
    13 years 10 months ago
    Construction of expanders and superconcentrators using Kolmogorov complexity
    Download  www.uni-ulm.de
    We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual probabilistic construction. It turns out that the...
    Uwe Schöning
    claim paper
    Read More »
    DAC
    2000
    ACM
    113views Computer Architecture» more  DAC 2000»
    Analysis of composition complexity and how to obtain smaller canonical graphs
    14 years 11 months ago
    Analysis of composition complexity and how to obtain smaller canonical graphs
    Download  www.ece.rice.edu
    Jawahar Jain, K. Mohanram, Dinos Moundanos, Ingo W...
    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.