1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.CC2024★ 1 cited
On the Exact Matching Problem in Dense Graphs
Nicolas El Maalouly, Sebastian Haslebacher, Lasse Wulf
In the Exact Matching problem, we are given a graph whose edges are colored red or blue and the task is to decide for a given integer k, if there is a perfect matching with exactly…
cs.DS2023★ 1 cited
A linear time algorithm for linearizing quadratic and higher-order shortest path problems
Eranda Çela, Bettina Klinz, Stefan Lendl +2
An instance of the NP-hard Quadratic Shortest Path Problem (QSPP) is called linearizable iff it is equivalent to an instance of the classic Shortest Path Problem (SPP) on the same…