The complexity of deciding whether a graph admits an orientation with fixed weak diameter.
Julien BensmailRomaric DuvignauSergey KirgizovPublished in: Discret. Math. Theor. Comput. Sci. (2016)
Keyphrases
- random walk
- structured data
- weighted graph
- graph theory
- directed graph
- average degree
- graph based algorithm
- graph structure
- worst case
- computational cost
- computational complexity
- graph model
- space complexity
- upper bound
- probabilistic model
- database
- image sequences
- social networks
- graph partitioning
- graph theoretic
- dependency graph
- bounded treewidth
- genetic algorithm
- data sets