-Decompositions of Eulerian Graphs: Complexity and Some Solvable Cases.
Armen S. AsratianNatalia OksimetsPublished in: Electron. Notes Discret. Math. (2003)
Keyphrases
- computational complexity
- special case
- np complete
- worst case
- polynomial time complexity
- database
- graph theoretic
- decision problems
- real time
- graph partitioning
- graph structure
- graph matching
- data sets
- memory requirements
- partial differential equations
- graph theory
- directed graph
- graph mining
- space complexity
- graph databases
- expert systems
- case study