Tutte Invariants for Alternating Dimaps

Yow, Kai Siong; Farr, Graham; Morgan, Kerri

doi:10.48550/arxiv.1803.05539

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that the structure of directed graphs is usually more complex than undirected graphs, and there are several Tutte-like polynomials for directed graphs that have been defined including the greedoid polynomial [57,136], cover polynomial [28] and Tutte invariants [137,135]. Problem 4.4.…”

Section: Community Searchmentioning

confidence: 99%

Learning-Based Approaches for Graph Problems: A Survey

Yow¹,

Luo²

2022

Preprint

Self Cite

View full text Add to dashboard Cite

Over the years, many graph problems specifically those in NP-complete are studied by a wide range of researchers. Some famous examples include graph colouring, travelling salesman problem and subgraph isomorphism. Most of these problems are typically addressed by exact algorithms, approximate algorithms and heuristics. There are however some drawback for each of these methods. Recent studies have employed learning-based frameworks such as machine learning techniques in solving these problems, given that they are useful in discovering new patterns in structured data that can be represented using graphs. This research direction has successfully attracted a considerable amount of attention. In this survey, we provide a systematic review mainly on classic graph problems in which learning-based approaches have been proposed in addressing the problems. We discuss the overview of each framework, and provide analyses based on the design and performance of the framework. Some potential research questions are also suggested. Ultimately, this survey gives a clearer insight and can be used as a stepping stone to the research community in studying problems in this field.

show abstract