End-Vertices of Graph Search Algorithms.
Dieter KratschMathieu LiedloffDaniel MeisterPublished in: CIAC (2015)
Keyphrases
- search algorithm
- weighted graph
- graph search
- labeled graphs
- adjacency matrix
- random graphs
- undirected graph
- edge weights
- vertex set
- planar graphs
- graph representation
- directed edges
- directed acyclic graph
- minimum weight
- maximum matching
- graph theoretic
- hamiltonian cycle
- graph theory
- average degree
- maximal cliques
- branch and bound
- attributed graphs
- graph matching
- heuristic search
- query graph
- search problems
- connected subgraphs
- graph structure
- search space
- betweenness centrality
- structured data
- graph partitioning
- bipartite graph
- strongly connected
- random walk
- semi supervised
- tree search
- path finding
- stable set
- bayesian networks
- directed graph
- spanning tree
- search tree
- connected graphs