Efficient, Adaptable Implementations of Graph Algorithms.
Dietmar KühlMarco NissenKarsten WeihePublished in: WAE (1997)
Keyphrases
- efficient implementation
- theoretical analysis
- graph theory
- computationally efficient
- learning algorithm
- computationally complex
- algorithms and data structures
- computationally intensive
- computationally expensive
- partitioning algorithm
- decision trees
- edge weights
- computational cost
- bipartite graph
- highly efficient
- graph model
- graph partitioning
- significant improvement
- graph construction
- maximum flow
- evolutionary algorithm
- computational complexity
- data structure