Linear Ordering on Graphs, Anti-Founded Sets and Polynomial Time Computability.
Alexei LisitsaVladimir Yu. SazonovPublished in: Theor. Comput. Sci. (1999)
Keyphrases
- special case
- graph isomorphism
- series parallel
- graph theoretic
- polynomial time complexity
- bounded treewidth
- convex sets
- graph mining
- planar graphs
- graph databases
- graph matching
- computational complexity
- neural network
- linear model
- graph representation
- weighted graph
- graph theory
- linear systems
- approximation algorithms
- partial order
- worst case