Focal Interest
Focal Interest

Graph theory

  1. Algorithm enumerates maximal balanced quasi-cliques in signed graphs
    Discover maximal balanced quasi-clique enumeration for signed graphs. A novel NP-hard algorithm identifies cohesive subgraphs with positive and negative edges using branch-and-bound optimization.
  2. BIM-based graph method optimizes hospital AGV routes
    Methodology for optimizing automated guided vehicle routes in hospitals using BIM, IFC standards, and graph-based pathfinding algorithms to enhance logistics efficiency.