Multi-agent Online Graph Exploration on Cycles and Tadpole Graphs.
Erik van den AkkerKevin BuchinKlaus-Tycho FoersterPublished in: SIROCCO (2024)
Keyphrases
- multi agent
- graph theory
- graph representation
- graph matching
- graph structure
- graph theoretic
- graph mining
- graph databases
- weighted graph
- adjacency matrix
- directed graph
- graph construction
- graph clustering
- bipartite graph
- graph partitioning
- random graphs
- graph theoretical
- graph properties
- graph structures
- subgraph isomorphism
- graph representations
- labeled graphs
- graph model
- graph search
- undirected graph
- reachability queries
- graph isomorphism
- structural pattern recognition
- spanning tree
- graph classification
- online learning
- graph data
- series parallel
- graph transformation
- connected graphs
- real world graphs
- attributed graphs
- graph kernels
- dynamic graph
- proximity graph
- finding the shortest path
- directed acyclic
- social graphs
- maximum common subgraph
- multi agent systems
- connected dominating set
- directed acyclic graph
- edge weights
- graph patterns
- random walk
- structured data
- dense subgraphs
- minimum spanning tree
- association graph
- graph drawing
- frequent subgraphs
- maximal cliques
- strongly connected
- disk resident
- neighborhood graph
- polynomial time complexity
- fully connected
- graph layout
- small world
- graph embedding
- inexact graph matching
- homology generators
- shortest path
- maximum clique