Abstract: The graph coloring problem involves coloring the nodes of a graph using the minimum number of colors such that no two adjacent nodes share the same color. This NP-hard problem has various ...

ABSTRACT: To effectively evaluate a system that performs operations on UML class diagrams, it is essential to cover a large variety of different types of diagrams. The coverage of the diagram space ...

Google’s June 2025 Core Update just finished. What’s notable is that while some say it was a big update, it didn’t feel disruptive, indicating that the changes may have been more subtle than game ...

Here’s a scary scenario: You’ve been put in charge of air traffic control at Newark airport near New York. You need to make sure every plane can taxi between the runway and its gate without hitting ...

Quantum computing based Grover's algorithm performs unstructured search problems in unsorted data to structured data in validating bit string through graph coloring. The quantum Grover's algorithm and ...

Graph theory is an integral component of algorithm design that underlies sparse matrices, relational databases, and networks. Improving the performance of graph algorithms has direct implications to ...

Abstract: The time and wavelength division multiplexing passive optical network (TWDM-PON) allows numerous users to share a single optical fiber and wavelength. In TWDM-PON, the optical network unit ...

Co-authored by Nigel Bairstow, Ph.D., and Jeremy Neofytos, Research Assistant Over the last seven years, the customer experience on social media has shifted dramatically, moving away from the early ...

Abstract: Coloring for random graph from G(n,1/2) is a classic example exhibiting an Information v. Computation gap: it has chromatic number of Theta(n/log n) w.p. 1-o(1) while the best efficiently ...