Sciweavers

    4865 search results - page 8 / 973
    » The Complexity of Graph Connectivity
    Sort
    View
    ICAT
    2007
    IEEE
    235views Artificial Intelligence» more  ICAT 2007»
    "Space Frames": Using space, color and animation in the visualization of complex graph systems
    14 years 2 months ago
    "Space Frames": Using space, color and animation in the visualization of complex graph systems
    Download  csdl2.computer.org
    This study concerns the development of 3D interfaces that aid the navigation of large data structures through the usage of the HSV color space, and the ensuing “spatial framesâ€...
    Elif E. Ayiter, Selim Balcisoy, Murat Germen, Isma...
    claim paper
    Read More »
    ACID
    2006
    220views Algorithms» more  ACID 2006»
    Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
    13 years 9 months ago
    Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
    Download  www.dcs.gla.ac.uk
    We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
    Henning Fernau, David Manlove
    claim paper
    Read More »
    WWW
    2004
    ACM
    119views Internet Technology» more  WWW 2004»
    Towards the composition of Ad Hoc B2B Applications: Semantics, Properties and Complexity Management
    14 years 8 months ago
    Towards the composition of Ad Hoc B2B Applications: Semantics, Properties and Complexity Management
    Download  rhizomik.net
    The goal is to build a general framework for ad hoc applications over large networks using semantics and complex systems analysis. The first part deals with semantics because appl...
    Jaime Delgado, Rosa Gil, Zièd Choukair
    claim paper
    Read More »
    ALGORITHMICA
    2008
    111views more  ALGORITHMICA 2008»
    Fixed-Parameter Complexity of Minimum Profile Problems
    13 years 7 months ago
    Fixed-Parameter Complexity of Minimum Profile Problems
    Download  www.cs.rhul.ac.uk
    The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
    Gregory Gutin, Stefan Szeider, Anders Yeo
    claim paper
    Read More »
    JACM
    2000
    119views more  JACM 2000»
    A minimum spanning tree algorithm with Inverse-Ackermann type complexity
    13 years 7 months ago
    A minimum spanning tree algorithm with Inverse-Ackermann type complexity
    Download  www.cs.princeton.edu
    A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
    Bernard Chazelle
    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.