共 50 条
- [11] An approach to solve graph coloring problem using adjacency matrix BIOSCIENCE BIOTECHNOLOGY RESEARCH COMMUNICATIONS, 2019, 12 (02): : 472 - 477
- [12] An Approach for Solving the Graph Coloring Problem using Adjacency Matrix PROCEEDINGS OF THE 2019 8TH INTERNATIONAL CONFERENCE ON SYSTEM MODELING & ADVANCEMENT IN RESEARCH TRENDS (SMART-2019), 2019, : 10 - 13
- [13] Placating Plato with Plates of Pasta: An Interactive Tool for Teaching the Dining Philosophers Problem 2017 IEEE FRONTIERS IN EDUCATION CONFERENCE (FIE), 2017,
- [14] Verifying Solutions to the Dining Philosophers Problem with Activity-Oriented Petri Nets PROCEEDINGS 2014 4TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE WITH APPLICATIONS IN ENGINEERING AND TECHNOLOGY ICAIET 2014, 2014, : 163 - 168
- [15] Vertex colouring using the adjacency matrix 2ND INTERNATIONAL CONFERENCE OF COMBINATORICS, GRAPH THEORY, AND NETWORK TOPOLOGY, 2019,
- [16] Generalising the Dining Philosophers Problem: Competitive Dynamic Resource Allocation in Multi-agent Systems MULTI-AGENT SYSTEMS, EUMAS 2018, 2019, 11450 : 30 - 47
- [17] Digital Filters Using Adjacency Matrix Representation MICAI 2008: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2008, 5317 : 394 - 406
- [18] Implementation of Vertex Colouring Using Adjacency Matrix 2021 5TH INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONICS, COMMUNICATION, COMPUTER TECHNOLOGIES AND OPTIMIZATION TECHNIQUES (ICEECCOT), 2021, : 69 - 73
- [19] Deadlock prevention using Petri nets and their unfoldings INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 1998, 14 (10): : 750 - 759
- [20] Deadlock prevention using Petri nets and their unfoldings Int J Adv Manuf Technol, 10 (750-759):