Sciweavers

    WG   2009 International Workshop on Graph-Theoretic Concepts in Computer Science
    Wall of Fame | Most Viewed WG-2009 Paper
    WG
    2009
    Springer
    153views Theoretical Computer Science» more  WG 2009»
    Fully Dynamic Representations of Interval Graphs
    13 years 11 months ago
    Fully Dynamic Representations of Interval Graphs
    Download  www-npa.lip6.fr
    We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
    Christophe Crespelle
    claim paper
    Read More »
    Disclaimer and Copyright Notice
    Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
    IdReadViewsTitleStatus
    1Download preprint from source153
    Fully Dynamic Representations of Interval Graphs
    claim
    2Download preprint from source146
    Chordal Digraphs
    claim
    3Download preprint from source136
    Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs
    claim
    4Download preprint from source120
    Graph-Theoretic Solutions to Computational Geometry Problems
    claim
    5Download preprint from source117
    A New Intersection Model and Improved Algorithms for Tolerance Graphs
    claim
    6Download preprint from source110
    Cycles, Paths, Connectivity and Diameter in Distance Graphs
    claim
    7Download preprint from source108
    An Exact Algorithm for Minimum Distortion Embedding
    claim
    8Download preprint from source108
    Sub-coloring and Hypo-coloring Interval Graphs
    claim
    9Download preprint from source108
    Distance d-Domination Games
    claim
    10Download preprint from source99
    Exact and Parameterized Algorithms for Max Internal Spanning Tree
    claim
    11Download preprint from source99
    Finding Induced Paths of Given Parity in Claw-Free Graphs
    claim
    12Download preprint from source99
    Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes
    claim
    13Download preprint from source97
    The Parameterized Complexity of Some Minimum Label Problems
    claim
    14Download preprint from source94
    Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph
    claim
    15Download preprint from source90
    Maximum Series-Parallel Subgraph
    claim
    16Download preprint from source81
    Hardness Results and Efficient Algorithms for Graph Powers
    claim
    17Download preprint from source71
    Injective Oriented Colourings
    claim
    18Download preprint from source70
    Directed Rank-Width and Displit Decomposition
    claim
    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.