Online graph exploration on a restricted graph class: Optimal solutions for tadpole graphs.
Sebastian BrandtKlaus-Tycho FoersterJonathan MaurerRoger WattenhoferPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- directed graph
- graph theory
- graph representation
- graph matching
- graph structure
- graph construction
- graph databases
- weighted graph
- graph model
- graph theoretic
- planar graphs
- graph structures
- graph mining
- labeled graphs
- graph classification
- graph partitioning
- adjacency matrix
- bipartite graph
- undirected graph
- graph clustering
- connected graphs
- graph isomorphism
- optimal solution
- subgraph isomorphism
- graph kernels
- dynamic graph
- graph theoretical
- series parallel
- attributed graphs
- graph search
- random graphs
- edge weights
- random walk
- directed acyclic
- disk resident
- graph transformation
- online learning
- real world graphs
- objective function
- structural pattern recognition
- spanning tree
- maximal cliques
- graph patterns
- graph layout
- inexact graph matching
- finding the shortest path
- proximity graph
- connected dominating set
- reachability queries
- densely connected
- association graph
- graph representations
- neighborhood graph
- graph data
- web graph
- total cost
- connected components