Sciweavers

    JGAA
    2007
    52views more  JGAA 2007»
    Equi-partitioning of Higher-dimensional Hyper-rectangular Grid Graphs
    14 years 19 days ago
    Equi-partitioning of Higher-dimensional Hyper-rectangular Grid Graphs
    Download  pages.cs.wisc.edu
    Athula Gunawardena, Robert R. Meyer
    claim paper
    Read More »
    JGAA
    2007
    142views more  JGAA 2007»
    Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
    14 years 19 days ago
    Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
    Download  jgaa.info
    The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
    Kerri Morgan, Graham Farr
    claim paper
    Read More »
    JGAA
    2007
    87views more  JGAA 2007»
    A 2.5D Hierarchical Drawing of Directed Graphs
    14 years 19 days ago
    A 2.5D Hierarchical Drawing of Directed Graphs
    Download  jgaa.info
    We introduce a new graph drawing convention for 2.5D hierarchical drawings of directed graphs. The vertex set is partitioned both into layers of vertices drawn in parallel planes ...
    Seok-Hee Hong, Nikola S. Nikolov, Alexandre Tarass...
    claim paper
    Read More »
    JGAA
    2007
    104views more  JGAA 2007»
    Bar k-Visibility Graphs
    14 years 19 days ago
    Bar k-Visibility Graphs
    Download  jgaa.info
    Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one c...
    Alice M. Dean, William Evans, Ellen Gethner, Joshu...
    claim paper
    Read More »
    JGAA
    2007
    124views more  JGAA 2007»
    Simultaneous Border Segmentation of Doughnut-Shaped Objects in Medical Images
    14 years 19 days ago
    Simultaneous Border Segmentation of Doughnut-Shaped Objects in Medical Images
    Download  jgaa.info
    Image segmentation with specific constraints has found applications in several areas such as biomedical image analysis and data mining. In this paper, we study the problem of sim...
    Xiaodong Wu, Michael B. Merickel
    claim paper
    Read More »
    JGAA
    2007
    66views more  JGAA 2007»
    Estimating the Number of s-t Paths in a Graph
    14 years 19 days ago
    Estimating the Number of s-t Paths in a Graph
    Download  jgaa.info
    Ben Roberts, Dirk P. Kroese
    claim paper
    Read More »
    JGAA
    2007
    135views more  JGAA 2007»
    Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
    14 years 19 days ago
    Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
    Download  www.emis.de
    Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
    Donatello Conte, Pasquale Foggia, Mario Vento
    claim paper
    Read More »
    JGAA
    2007
    81views more  JGAA 2007»
    The Traveling Salesman Problem for Cubic Graphs
    14 years 19 days ago
    The Traveling Salesman Problem for Cubic Graphs
    Download  www.emis.de
    We show how to find a Hamiltonian cycle in a graph of degree at most three with n vertices, in time O(2n/3
    David Eppstein
    claim paper
    Read More »
    JGAA
    2007
    123views more  JGAA 2007»
    A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
    14 years 19 days ago
    A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
    Download  www.dms.umontreal.ca
    Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
    Louigi Addario-Berry, Neil Olver, Adrian Vetta
    claim paper
    Read More »
    JGAA
    2007
    88views more  JGAA 2007»
    Dynamic Spectral Layout with an Application to Small Worlds
    14 years 19 days ago
    Dynamic Spectral Layout with an Application to Small Worlds
    Download  jgaa.info
    Spectral methods are naturally suited for dynamic graph layout because, usually, moderate changes of a graph yield moderate changes of the layout. We discuss some general principl...
    Ulrik Brandes, Daniel Fleischer, Thomas Puppe
    claim paper
    Read More »
    12next ›last »
    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.