An optical solution for the set splitting problem

12/02/2017
by   Mihai Oltean, et al.
0

We describe here an optical device, based on time-delays, for solving the set splitting problem which is well-known NP-complete problem. The device has a graph-like structure and the light is traversing it from a start node to a destination node. All possible (potential) paths in the graph are generated and at the destination we will check which one satisfies completely the problem's constrains.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/15/2019

Tracking Paths in Planar Graphs

We consider the NP-complete problem of tracking paths in a graph, first ...
research
01/30/2018

Combinatorial Characterisations of Graphical Computational Search Problems

A Graphical Search problem, denoted Π(X,γ), where X is the vertex set or...
research
02/24/2022

Planarizing Graphs and their Drawings by Vertex Splitting

The splitting number of a graph G=(V,E) is the minimum number of vertex ...
research
02/12/2020

Optimal Label Splitting for Embedding an LTS into an arbitrary Petri Net Reachability Graph is NP-complete

For a given labelled transition system (LTS), synthesis is the task to f...
research
08/28/2018

Shortest Paths with Ordinal Weights

We investigate the single-source-single-destination "shortest" paths pro...
research
12/02/2021

On the Dominant of the Multicut Polytope

Given a graph G=(V,E) and a set S ⊆V2 of terminal pairs, the minimum mul...
research
04/25/2011

MGA trajectory planning with an ACO-inspired algorithm

Given a set of celestial bodies, the problem of finding an optimal seque...

Please sign up or login with your details

Forgot password? Click here to reset