Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
From MaRDI portal
(Redirected from Publication:2907957)
Recommendations
- Algorithm for identifying (2,2)-bipartite graphs
- Algorithmic aspects of bipartite graphs
- Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs
- An efficient algorithm for Helly property recognition in a linear hypergraph
- An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs
- A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs
- Recognizing hyperelliptic graphs in polynomial time
- Recognizing hyperelliptic graphs in polynomial time
- Recognition and combinatorial optimization algorithms for bipartite chain graphs
- Bipartite Hansel results for hypergraphs
Cites work
- A Characterization of Comparability Graphs and of Interval Graphs
- A hierarchy of self-clique graphs
- Algorithms on circular-arc graphs
- Biclique graphs and biclique matrices
- Biclique-Helly graphs
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- Generating bicliques of a graph in lexicographic order
- On hereditary Helly classes of graphs
Cited in
(5)
This page was built for publication: Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907957)
