Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.
Krishnendu ChatterjeeMonika HenzingerSagar KaleAlexander SvozilPublished in: ICALP (2021)
Keyphrases
- graph theory
- max cut
- computationally efficient
- graph search
- learning algorithm
- graph matching
- significant improvement
- maximal cliques
- graph databases
- graph data
- maximum cardinality
- graph isomorphism
- representational power
- graph representation
- spanning tree
- weighted graph
- bipartite graph
- game theory
- computational cost
- web graph
- graph theoretic
- memory efficient
- computationally demanding
- graph structure
- maximum clique
- directed graph
- polynomial time complexity