Sciweavers

3396 search results - page 125 / 680
» Tree representations of graphs
Sort
View
GD
2005
Springer
14 years 2 months ago
Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness
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 co...
Alice M. Dean, William Evans, Ellen Gethner, Joshu...
JGAA
2007
104views more  JGAA 2007»
13 years 9 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...
ICPR
2008
IEEE
14 years 3 months ago
An approximate algorithm for median graph computation using graph embedding
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
Miquel Ferrer, Ernest Valveny, Francesc Serratosa,...
ML
2010
ACM
185views Machine Learning» more  ML 2010»
13 years 3 months ago
Learning to rank on graphs
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
Shivani Agarwal
IJFCS
2010
60views more  IJFCS 2010»
13 years 7 months ago
Properties of Quasi-Relabeling Tree Bimorphisms
The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is dened by a tree bimorphism (...
Andreas Maletti, Catalin Ionut Tîrnauca