Sciweavers

2487 search results - page 120 / 498
» Partitions of Graphs into Trees
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 10 months ago
Quasi-randomness of graph balanced cut properties
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
Hao Huang, Choongbum Lee
DCG
2002
66views more  DCG 2002»
14 years 10 months ago
Generation of Oriented Matroids - A Graph Theoretical Approach
We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretica...
Lukas Finschi, Komei Fukuda
PAAPP
1998
149views more  PAAPP 1998»
14 years 9 months ago
Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
Sumanta Guha
APVIS
2007
14 years 11 months ago
Navigation techniques for 2.5D graph layout
In this paper, we consider the problem of navigating graphs drawn in 2.5 dimensions. First, we define criteria for good navigation and then present various methods to satisfy som...
Adel Ahmed, Seok-Hee Hong
JDA
2006
98views more  JDA 2006»
14 years 10 months ago
Completely connected clustered graphs
Abstract. Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the p...
Sabine Cornelsen, Dorothea Wagner