Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices
Palash Dey, Anubhav Dhar, Ashlesha Hota +2
In this paper, we study the Maximum Common Vertex Subgraph problem: Given two input graphs and a non-negative integer , is there a common subgraph on at least …
cs.CC2025
Universal Solvability for Robot Motion Planning on Graphs
Anubhav Dhar, Pranav Nyati, Tanishq Prasad +2
We study the Universal Solvability of Robot Motion Planning on Graphs (USolR) problem: given an undirected graph and robots, determine whether any arbitrary config…