Sciweavers

1420 search results - page 38 / 284
» Representation of Graphs by OBDDs
Sort
View
168
Voted
GD
2005
Springer
15 years 11 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»
15 years 6 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
16 years 18 days 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»
15 years 29 days 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
DCC
2007
IEEE
16 years 5 months ago
Structure induction by lossless graph compression
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
Leonid Peshkin