Tag: Graph Theory and Algorithms
Algorithm enumerates maximal balanced quasi-cliques in signed graphs
—
in AlgorithmDiscover 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.
Parallel conflict graph management reduced MIP solve time
—
in AlgorithmParallel algorithms for conflict graph management in mixed-integer programming enable larger cutting plane pools and substantially reduce solver times, especially for difficult problem instances.
GeoGraphNetworks provides validated spatial network data
—
GeoGraphNetworks: 110 validated spatial networks spanning US and UK transportation and hydrological systems in analysis-ready JSON and XLSX formats with complete topological and geographic data.
Temporal-clique query processing is made more efficient
—
Temporal-clique subgraph pattern matching via integrated topological and temporal selectivity optimization with specialized join operators and cardinality estimation.
BenchPCNP provides labeled printed circuit netlist graph data
—
in EngineeringBenchPCNP: A labeled printed circuit netlist graph dataset for partitioning benchmarking, constructed from 50 production-verified circuits with 54 distinct module labels following IPC-2612 standards.
HKEN improved influential-node identification in network tests
Algorithm for identifying influential nodes in complex networks by integrating hierarchical k-shell decomposition with extended neighborhood analysis, validated against SIR propagation models.
