Polynomial-delay enumeration of monotonic graph classes
From MaRDI portal
Publication:2880911
zbMATH Open1235.68183MaRDI QIDQ2880911FDOQ2880911
Authors: Jan Ramon, Siegfried Nijssen
Publication date: 17 April 2012
Published in: Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)
Full work available at URL: http://www.jmlr.org/papers/v10/ramon09a.html
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
Learning and adaptive systems in artificial intelligence (68T05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
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)