1648 search results - page 47 / 330 » On the generation of bicliques of a graph |
APVIS
2008
14 years 11 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...
ENTCS
2006
2006
Overview of Formal Concepts for Model Transformations Based on Typed Attributed Graph Transformation
14 years 9 months ago
In this paper we give an overview of formal concepts for model transformations between visual languages based on typed attributed graph transformation. We start with a basic conce...
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
While data mining in chemoinformatics studied graph data with dozens of nodes, systems biology and the Internet are now generating graph data with thousands and millions of nodes....
ALGORITHMICA
2006
14 years 9 months ago
2006
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...