#### Filter Results:

#### Publication Year

2005

2017

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

This paper presents parallel versions of Gusfield's cut tree algorithm. Cut trees are a compact representation of the edge-connectivity between every pair of vertices of an undirected graph. Cut trees have many applications in combinatorial optimization and in the analysis of networks originated in many applied fields. However, surprisingly few works have… (More)

A biclique of a graph G is a maximal induced complete bipartite subgraph of G. The biclique graph of G denoted by KB(G), is the intersection graph of all the bicliques of G. The biclique graph can be thought as an operator between the class of all graphs. The iterated biclique graph of G denoted by KB k (G), is the graph obtained by applying the biclique… (More)