1648 search results - page 28 / 330 » On the generation of bicliques of a graph |
57
Voted
NIPS
2003
14 years 11 months ago
2003
This paper addresses the problem of untangling hidden graphs from a set of noisy detections of undirected edges. We present a model of the generation of the observed graph that in...
87
Voted
GD
1995
Springer
15 years 1 months ago
1995
Springer
Abstract. Generating incrementally stable layouts is important for visualizing dynamic graphs in many applications. This paper describes DynaDAG, a new heuristic for incremental la...
JCT
2007
14 years 9 months ago
2007
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that...
IJAC
2008
14 years 9 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
WWW
2010
ACM
15 years 4 months ago
2010
ACM
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...