Generating random graphs with hard and soft constraints
by Mohamed Amine Omrani; Wady Naanaa
International Journal of Computer Aided Engineering and Technology (IJCAET), Vol. 17, No. 2, 2022

Abstract: Since its appearance in discrete mathematics, graphs have gained increasing importance due to their capacity to model and solve real-world computational problems. They even make it possible to handle fuzzy situations. The current research investigates the issue of generating random graphs using both hard and soft constraints. The aim of this paper is to suggest a constraint-based encoding of graph generation in order to take advantage of the flurry of efficient solution algorithms available within the constraint programming framework. Experimental results obtained from a series of tests confirm that the proposed method lays the basis for further real-world applications in different fields, such as analytical chemistry, telecommunication networks, and civil engineering.

Online publication date: Wed, 24-Aug-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Aided Engineering and Technology (IJCAET):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com