Sciweavers

384 search results - page 14 / 77
» On s-hamiltonian-connected line graphs
Sort
View
DCC
2004
IEEE
14 years 8 months ago
LDPC Codes from Triangle-Free Line Sets
We study sets of lines of AG(n, q) and PG(n, q) with the property that no three lines form a triangle. As a result the associated point-line incidence graph contains no 6-cycles a...
Keith E. Mellinger
WAW
2010
Springer
312views Algorithms» more  WAW 2010»
13 years 6 months ago
The Geometric Protean Model for On-Line Social Networks
We introduce a new geometric, rank-based model for the link structure of on-line social networks (OSNs). In the geo-protean (GEO-P) model for OSNs nodes are identified with points ...
Anthony Bonato, Jeannette Janssen, Pawel Pralat
ISAAC
2004
Springer
98views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Inner Rectangular Drawings of Plane Graphs
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner ...
Kazuyuki Miura, Hiroki Haga, Takao Nishizeki
ACSC
2010
IEEE
13 years 3 months ago
Efficient contour line labelling for terrain modelling
Terrains are an essential part of outdoor environments. Terrain models are important for computer games and applications in architecture, urban design and archaeology. A popular a...
Xin Xie, Burkhard Wünsche
GBRPR
2009
Springer
13 years 6 months ago
Electric Field Theory Motivated Graph Construction for Optimal Medical Image Segmentation
In this paper, we present a novel graph construction method and demonstrate its usage in a broad range of applications starting from a relatively simple single-surface segmentation...
Yin Yin, Qi Song, Milan Sonka