Lecture Notes in Computer Science
DOI: 10.1007/978-3-540-72504-6_6
|View full text |Cite
|
Sign up to set email alerts
|

A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
3
1
1

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…Then by applying their algorithm to the NCI dataset [4], they found typical subgraph structures of chemical compounds. Yamasaki and Shoudai [9] proposed an interval graph pattern and presented a polynomial time algorithm for finding a minimally generalized interval graph pattern explaining a given finite set of interval graphs. As other related works, in the framework of inductive inference, by Suzuki et al [6] and Takami et al [7] gave polynomial time learning algorithms for tree patterns with internal structured variables and two-terminal series parallel graph patterns, respectively.…”
Section: Introductionmentioning
confidence: 99%
“…Then by applying their algorithm to the NCI dataset [4], they found typical subgraph structures of chemical compounds. Yamasaki and Shoudai [9] proposed an interval graph pattern and presented a polynomial time algorithm for finding a minimally generalized interval graph pattern explaining a given finite set of interval graphs. As other related works, in the framework of inductive inference, by Suzuki et al [6] and Takami et al [7] gave polynomial time learning algorithms for tree patterns with internal structured variables and two-terminal series parallel graph patterns, respectively.…”
Section: Introductionmentioning
confidence: 99%