|
gptkbp:instanceOf
|
gptkb:academic
gptkb:mathematical_concept
|
|
gptkbp:appliesTo
|
biology
chemistry
computer science
linguistics
operations research
physics
social sciences
|
|
gptkbp:hasConcept
|
gptkb:Hamiltonian_path
gptkb:tree
gptkb:university
gptkb:clique
gptkb:Eulerian_circuit
graph
path
graph coloring
independent set
cut
bipartite graph
weighted graph
edge
vertex
adjacency
chromatic number
component
cycle
flow
graph isomorphism
graph minor
graph traversal
matching
minimum spanning tree
network flow
planarity
random graph
spanning tree
subgraph
unweighted graph
|
|
gptkbp:hasSubfield
|
gptkb:algebraic_graph_theory
gptkb:algorithmic_graph_theory
gptkb:applied_graph_theory
gptkb:extremal_graph_theory
gptkb:spectral_graph_theory
gptkb:structural_graph_theory
random graph theory
topological graph theory
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Graph theory
|
|
gptkbp:importantAlgorithm
|
gptkb:Breadth-first_search
gptkb:Depth-first_search
gptkb:Edmonds-Karp_algorithm
gptkb:Ford-Fulkerson_algorithm
gptkb:Kosaraju's_algorithm
gptkb:Kruskal's_algorithm
gptkb:Prim's_algorithm
gptkb:Dijkstra's_algorithm
gptkb:Tarjan's_algorithm
gptkb:Bellman-Ford_algorithm
gptkb:Floyd-Warshall_algorithm
|
|
gptkbp:originatedIn
|
gptkb:Leonhard_Euler
gptkb:Seven_Bridges_of_Königsberg_problem
|
|
gptkbp:relatedTo
|
gptkb:logic
gptkb:topology
discrete mathematics
combinatorics
algorithm theory
network science
|
|
gptkbp:studies
|
gptkb:Eulerian_paths
gptkb:network_protocol
paths
trees
connectivity
graphs
planar graphs
graph algorithms
edges
vertices
random graphs
Hamiltonian cycles
bipartite graphs
cliques
coloring
cycles
directed graphs
flows
graph isomorphism
graph minors
independent sets
matching
networks
undirected graphs
unweighted graphs
weighted graphs
|
|
gptkbp:bfsParent
|
gptkb:group_of_people
|
|
gptkbp:bfsLayer
|
4
|