5473 search results - page 138 / 1095 » On the graph isomorphism problem |
165
click to vote
AAIM
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We present new kernelization results for the s-cycle transversal problem for s > 3. In particular, we show a 6k2 kernel for 4-cycle transversal and a O(ks−1 ) kernel...
214
click to vote
ISAAC
1993
Springer
15 years 11 months ago
1993
Springer
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
129
click to vote
BIRTHDAY
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
188
click to vote
WADS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5k kn2 ). The algor...
155
Voted
COR
2006
15 years 7 months ago
2006
A well known transformation by Pearn, Assad and Golden reduces a Capacitated Arc Routing Problem (CARP) into an equivalent Capacitated Vehicle Routing Problem (CVRP). However, tha...