Maximal common connected sets of interval graphs
From MaRDI portal
Recommendations
- Fast algorithms for identifying maximal common connected sets of interval graphs
- A direct algorithm to find a largest common connected induced subgraph of two graphs
- Competitive graph searches
- Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms
- scientific article; zbMATH DE number 3892606
Cited in
(2)
This page was built for publication: Maximal common connected sets of interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315344)