The complexity of graph problems for succinctly represented graphs

Author(s):  
Antonio Lozano ◽  
José L. Balcázar
Keyword(s):  
2017 ◽  
Vol 51 (1) ◽  
pp. 261-266 ◽  
Author(s):  
Édouard Bonnet ◽  
Vangelis Th. Paschos
Keyword(s):  

2001 ◽  
Vol 63 (4) ◽  
pp. 639-671 ◽  
Author(s):  
Uriel Feige ◽  
Joe Kilian
Keyword(s):  

2021 ◽  
Vol 868 ◽  
pp. 46-64
Author(s):  
Klaus Heeger ◽  
Anne-Sophie Himmel ◽  
Frank Kammer ◽  
Rolf Niedermeier ◽  
Malte Renken ◽  
...  
Keyword(s):  

1982 ◽  
Vol 25 (9) ◽  
pp. 659-665 ◽  
Author(s):  
Francis Y. Chin ◽  
John Lam ◽  
I-Ngo Chen

2021 ◽  
Vol 23 (2) ◽  
pp. 13-22
Author(s):  
Debmalya Mandal ◽  
Sourav Medya ◽  
Brian Uzzi ◽  
Charu Aggarwal

Graph Neural Networks (GNNs), a generalization of deep neural networks on graph data have been widely used in various domains, ranging from drug discovery to recommender systems. However, GNNs on such applications are limited when there are few available samples. Meta-learning has been an important framework to address the lack of samples in machine learning, and in recent years, researchers have started to apply meta-learning to GNNs. In this work, we provide a comprehensive survey of different metalearning approaches involving GNNs on various graph problems showing the power of using these two approaches together. We categorize the literature based on proposed architectures, shared representations, and applications. Finally, we discuss several exciting future research directions and open problems.


Author(s):  
Ji Youn Lee ◽  
Hee-Woong Lim ◽  
Suk-In Yoo ◽  
Byoung-Tak Zhang ◽  
Tai Hyun Park

2008 ◽  
pp. 958-961
Author(s):  
Camil Demetrescu ◽  
Giuseppe F. Italiano

Author(s):  
Joan Feigenbaum ◽  
Sampath Kannan ◽  
Andrew McGregor ◽  
Siddharth Suri ◽  
Jian Zhang
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document