4 Questions 92 Answers 0 Followers
Questions related from Daniel Page
I am aware that the minimum (cardinality) vertex cover problem on cubic graphs (i.e., 3-regular) graphs is NP-hard. Say positive integer k>2 is fixed. Has there been any computational...
19 January 2015 7,613 2 View
I am wondering if anybody can provide any handy resources (for a theoretical computer scientist) in relation to the convex cost flow problem? I have found texts (mostly my combinatorial...
07 December 2014 2,434 7 View
We don't have a result yet, but what is your opinion on what it may be? For example, P =NP, P!=NP, or P vs. NP is undecidable? Or if you are not sure, it is feasible to simply state, I don't know.
11 July 2013 9,456 58 View
I always am curious of what types of combinatorial or mathematical objects (in general) interest other researchers. For myself I have a pretty keen interest in types of restricted weak integer...
13 September 2012 1,538 84 View