5 citations · 15 across the 12 of their papers we have counts for
3 papers · 1 filter
A tight relation between series-parallel graphs and Bipartite Distance Hereditary graphs
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa +1
Bandelt and Mulder's structural characterization of Bipartite Distance Hereditary graphs asserts that such graphs can be built inductively starting from a single vertex and by repe…
On Computing the Galois Lattice of Bipartite Distance Hereditary Graphs
Nicola Apollonio, Paolo Giulio Franciosa
The class of Bipartite Distance Hereditary (BDH) graphs is the intersection between bipartite domino-free and chordal bipartite graphs.\ Graphs in both the latter classes have line…
Incremental DFS Trees on Arbitrary Directed Graphs
Giorgio Ausiello, Paolo G. Franciosa, Giuseppe F. Italiano +1
We present a new algorithm for maintaining a DFS tree of an arbitrary directed graph under any sequence of edge insertions. Our algorithm requires a total of time in…