The well-known topic of crisp graph planarity is contrasted with the more new and thoroughly studied field of planarity inside a fuzzy framework. In cubic fuzzy domain, cubic multisets with interval ...
Many combinatorial optimization problems 1 belong to the complexity classes, called NP-complete and NP-hard 2, and it is believed that they require a computation time scaling exponentially or faster ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results