Time and Space Efficient Discovery of Maximal Geometric Graphs-Reference-Cited by-同舟云学术

Time and Space Efficient Discovery of Maximal Geometric Graphs

Published: Issue: Volume: Page:42-55
ISSN:
Container-title:Discovery Science
language:
Short-container-title:

Author:

Arimura Hiroki,Uno Takeaki,Shimozono Shinichi

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-75488-6_6.pdf

Reference28 articles.

1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms (1983)

2. Akutsu, T., Tamaki, H., Tokuyama, T.: Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets. Discr. & Comp. Geom. 20(3), 307–331 (1998)

3. Lecture Notes in Artificial Intelligence;H. Arimura,2005

4. Lecture Notes in Computer Science;H. Arimura,2005

5. Arimura, H., Uno, T.: Effcient algorithms for mining maximal flexible patterns in texts and sequences, TCS-TR-A-06-20, DCS, Hokkaido Univeristy 2006 (submitting)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2019-09-01

2. Mining Frequent Patterns in 2D+t Grid Graphs for Cellular Automata Analysis;Graph-Based Representations in Pattern Recognition;2017

3. GriMa: A Grid Mining Algorithm for Bag-of-Grid-Based Classification;Lecture Notes in Computer Science;2016

4. Mining Preserving Structures in a Graph Sequence;Lecture Notes in Computer Science;2015

5. Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score;Similarity Search and Applications;2015