Polynomial-delay enumeration of monotonic graph classes
From MaRDI portal
Publication:2880911
Recommendations
- Mine 'em all: a note on mining all graphs
- New polynomial delay bounds for maximal subgraph enumeration by proximity search
- Probabilistic and exact frequent subtree mining in graphs beyond forests
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
- Enumerating connected induced subgraphs: improved delay and experimental comparison
Cited in
(6)- Analysis and enumeration. Algorithms for biological graphs
- Mine 'em all: a note on mining all graphs
- Kernelization of cycle packing with relaxed disjointness constraints
- A polynomial delay algorithm for enumerating 2-edge-connected induced subgraphs
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
This page was built for publication: Polynomial-delay enumeration of monotonic graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2880911)