Sciweavers

Share
JGAA
2007
52views more  JGAA 2007»
9 years 11 months ago
Equi-partitioning of Higher-dimensional Hyper-rectangular Grid Graphs
Athula Gunawardena, Robert R. Meyer
JGAA
2007
142views more  JGAA 2007»
9 years 11 months ago
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
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
JGAA
2007
87views more  JGAA 2007»
9 years 11 months ago
A 2.5D Hierarchical Drawing of Directed Graphs
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...
JGAA
2007
104views more  JGAA 2007»
9 years 11 months ago
Bar k-Visibility Graphs
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...
JGAA
2007
124views more  JGAA 2007»
9 years 11 months ago
Simultaneous Border Segmentation of Doughnut-Shaped Objects in Medical Images
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
JGAA
2007
66views more  JGAA 2007»
9 years 11 months ago
Estimating the Number of s-t Paths in a Graph
Ben Roberts, Dirk P. Kroese
JGAA
2007
135views more  JGAA 2007»
9 years 11 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
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
JGAA
2007
81views more  JGAA 2007»
9 years 11 months ago
The Traveling Salesman Problem for Cubic Graphs
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
JGAA
2007
123views more  JGAA 2007»
9 years 11 months ago
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
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
JGAA
2007
88views more  JGAA 2007»
9 years 11 months ago
Dynamic Spectral Layout with an Application to Small Worlds
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
books