2125 search results - page 36 / 425 » On Graph Complexity |
ICDM
2009
IEEE
13 years 5 months ago
2009
IEEE
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
APVIS
2008
13 years 9 months ago
2008
Effectively visualizing complex node-link graphs which depict relationships among data nodes is a challenging task due to the clutter and occlusion resulting from an excessive amo...
MST
2011
13 years 2 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
COMBINATORICS
1999
13 years 7 months ago
1999
Abstract. Ehrenborg and Steingr
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...