Sciweavers

505 search results - page 39 / 101
» On A Graph Formalism for Ordered Edges
Sort
View
DM
2010
124views more  DM 2010»
14 years 7 months ago
Perfect dodecagon quadrangle systems
A dodecagon quadrangle is the graph consisting of two cycles: a 12-cycle (x1, x2, ..., x12) and a 4-cycle (x1, x4, x7, x10). A dodecagon quadrangle system of order n and index [D...
Lucia Gionfriddo, Mario Gionfriddo
BMVC
2010
14 years 7 months ago
Classifying Textile Designs using Region Graphs
Markov random field pixel labelling is often used to obtain image segmentations in which each segment or region is labelled according to its attributes such as colour or texture. ...
Wei Jia, Stephen J. McKenna, Annette A. Ward, Keit...
72
Voted
ISAAC
2007
Springer
120views Algorithms» more  ISAAC 2007»
15 years 3 months ago
Succinct Representation of Labeled Graphs
Abstract. We consider the problem of designing succinct representations of labeled graphs (we consider vertex labeled planar triangulations, as well as edge labeled planar graphs a...
Jérémy Barbay, Luca Castelli Aleardi...
IPPS
2009
IEEE
15 years 4 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
TON
2012
13 years 3 days ago
Independent Directed Acyclic Graphs for Resilient Multipath Routing
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
Sangman Cho, Theodore Elhourani, Srinivasan Ramasu...