Induction On Graphs
Induction On Graphs is a graph-theoretic proof technique that extends mathematical induction to discrete structures by establishing a base case on a minimal graph and inductively extending the result to larger graphs through the addition of vertices or edges.
38
Publications
4.6K
Citations
71
Authors
39
Institutions
Publications per year
2017–2026
1
Parents
38
Peter Clark, Tim Niblett · Machine Learning · 1989 · 2K citations · Full text
Peter Clark, Tim Niblett · Machine Learning · 1989 · 994 citations · Full text
A new approach to induction and imprimitivity results
Stefaan Vaes · Journal of Functional Analysis · 2005 · 108 citations · Full text
1–5 of 38
71
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 71
39
Hebrew University of Jerusalem
Jerusalem, Israel
2 h-index
5 publications
281 citations
The University of Osaka
Osaka, Japan
2 h-index
8 publications
146 citations

McGill University
Montreal, Canada
2 h-index
4 publications
153 citations

Turing Institute
Glasgow, United Kingdom
2 h-index
4 publications
6K citations
Courant Institute of Mathematical Sciences
New York, United States
1 h-index
1 publications
51 citations
The University of Texas at Arlington
Arlington, United States
1 h-index
1 publications
22 citations

Pennsylvania State University
State College, United States
1 h-index
1 publications
22 citations
University of Illinois Chicago
Chicago, United States
1 h-index
1 publications
117 citations
1–8 of 39
4 publications · 140 citations
4
h-index
3 publications · 44 citations
3
h-index
2 publications · 3K citations
2
h-index
2 publications · 108 citations
2
h-index
1 publications · 81 citations
1
h-index
1–5