Sciweavers

3204 search results - page 321 / 641
» The b-chromatic Number of a Graph
Sort
View
PVLDB
2010
129views more  PVLDB 2010»
15 years 5 months ago
iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques
Graphs are of growing importance in modeling complex structures such as chemical compounds, proteins, images, and program dependence. Given a query graph Q, the subgraph isomorphi...
Wook-Shin Han, Jinsoo Lee, Minh-Duc Pham, Jeffrey ...
COMBINATORICS
2002
93views more  COMBINATORICS 2002»
15 years 6 months ago
On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...
Alexandr V. Kostochka
VLC
2002
93views more  VLC 2002»
15 years 6 months ago
Metrics for Graph Drawing Aesthetics
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...
Helen C. Purchase
GC
2010
Springer
15 years 5 months ago
Integer Functions on the Cycle Space and Edges of a Graph
A directed graph has a natural Z-module homomorphism from the underlying graph’s cycle space to Z where the image of an oriented cycle is the number of forward edges minus the n...
Daniel C. Slilaty
JDA
2010
95views more  JDA 2010»
15 years 5 months ago
Sigma-local graphs
We introduce and analyze σ-local graphs, based on a definition of locality by Erickson [12]. We present two algorithms to construct such graphs, for any real number σ > 1 an...
Prosenjit Bose, Sébastien Collette, Stefan ...