An improved upper bound for the online graph exploration problem on unicyclic graphs.
Koji M. KobayashiYing LiPublished in: J. Comb. Optim. (2024)
Keyphrases
- upper bound
- graph representation
- graph theory
- graph matching
- graph structure
- weighted graph
- directed graph
- graph theoretic
- graph mining
- labeled graphs
- graph databases
- lower bound
- graph properties
- graph classification
- graph search
- graph model
- graph clustering
- graph construction
- online learning
- graph partitioning
- graph theoretical
- random graphs
- worst case
- series parallel
- graph structures
- adjacency matrix
- subgraph isomorphism
- bipartite graph
- finding the shortest path
- graph representations
- graph data
- structural pattern recognition
- evolving graphs
- graph kernels
- planar graphs
- disk resident
- branch and bound algorithm
- graph transformation
- connected dominating set
- spanning tree
- undirected graph
- small world
- web graph
- quasi cliques
- dense subgraphs
- reachability queries
- graph drawing
- graph isomorphism
- real world graphs
- minimum spanning tree
- frequent subgraphs
- maximum cardinality
- maximum common subgraph
- query graph
- graph layout
- neighborhood graph
- inexact graph matching
- random walk
- community discovery
- topological information
- attributed graphs
- maximum clique
- connected graphs
- social graphs
- shortest path
- graphical models
- massive graphs
- structured data
- polynomial time complexity
- edge weights
- graph patterns
- constant factor
- graph embedding