The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Graphs and Recursive Counting
Abstract
The chapter introduces graphs as models for representing objects and relationships, defining concepts such as the Hamiltonian cycle and the Dirac theorem for their analysis. Next, the chapter explores recursive counting, a powerful method that solves complex problems by breaking them into simpler subproblems. This method is applied to the computation of permutations and combinations, highlighting how a recursive approach simplifies the solving of combinatorial problems. The chapter also discusses applications of graphs and recursive counting in various fields, such as network design, planning, and data analysis. Several examples show how graphs and recursive counting can be used to solve combinatorial problems. These examples include the analysis of social platforms, urban road systems, protein interactions, and the simulation of peer-to-peer (P2P) networks. Finally, a problem inspired by the Cretan labyrinth is examined, and several approaches to finding possible paths in a maze are discussed, such as the A* algorithm, breadth-first search (BFS), and a recursive approach.
Related Content
|
.
© 2026.
18 pages.
|
|
.
© 2026.
16 pages.
|
|
.
© 2026.
18 pages.
|
|
.
© 2026.
26 pages.
|
|
.
© 2026.
32 pages.
|
|
.
© 2026.
30 pages.
|
|
.
© 2026.
24 pages.
|
|
|