On computing the Galois lattice of bipartite distance hereditary graphs

DOI10.1016/j.dam.2017.04.004zbMath1365.05067arXiv1510.06883OpenAlexW2962993138MaRDI QIDQ2357768

Nicola Apollonio, Paolo Giulio Franciosa

Publication date: 14 June 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.06883

zbMATH Keywords

Galois latticesbipartite graphsdistance hereditary graphsmaximal bicliques

Mathematics Subject Classification ID

Partial orders, general (06A06) Distance in graphs (05C12)

Related Items (1)

A tight relation between series-parallel graphs and bipartite distance hereditary graphs

Cites Work

• Unnamed Item
• Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
• Consensus algorithms for the generation of all maximal bicliques
• Completely separable graphs
• Distance-hereditary graphs
• Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
• Arboricity and bipartite subgraph listing algorithms
• Can visibility graphs be represented compactly?
• The arborescence-realization problem
• On the Galois lattice of bipartite distance hereditary graphs
• Chromatic characterization of biclique covers
• A local approach to concept generation
• A convexity upper bound for the number of maximal bicliques of a bipartite graph
• A Linear Recognition Algorithm for Cographs
• An Almost Linear-Time Algorithm for Graph Realization
• Dismantlable Lattices in the Mirror
• Algorithm Theory - SWAT 2004
• Formal Concept Analysis
• Combinatorial optimization. Theory and algorithms.
• Bicliques in graphs. I: Bounds on their number
• A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
• On computing the size of a lattice and related decision problems

This page was built for publication: On computing the Galois lattice of bipartite distance hereditary graphs