21 citations · 38 across the 18 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DS2010★ 4 cited
Small Vertex Cover makes Petri Net Coverability and Boundedness Easier
M. Praveen
The coverability and boundedness problems for Petri nets are known to be Expspace-complete. Given a Petri net, we associate a graph with it. With the vertex cover number k of this…
cs.LO2010
Does Treewidth Help in Modal Satisfiability?
M. Praveen
Many tractable algorithms for solving the Constraint Satisfaction Problem (CSP) have been developed using the notion of the treewidth of some graph derived from the input CSP insta…