000121628 001__ 121628
000121628 005__ 20190331192655.0
000121628 0247_ $$2doi$$a10.1016/j.tcs.2004.05.009
000121628 037__ $$aARTICLE
000121628 245__ $$aOn the complexity of fixed parameter clique and dominating set
000121628 269__ $$a2004
000121628 260__ $$c2004
000121628 336__ $$aJournal Articles
000121628 520__ $$aWe provide simple, faster algorithms for the detection of cliques and dominating sets of fixed order. Our algorithms are based on reductions to rectangular matrix multiplication. We also describe an improved algorithm for diamonds detection. © 2004 Elsevier B.V. All rights reserved.
000121628 700__ $$0240331$$g183121$$aEisenbrand, Friedrich
000121628 700__ $$aGrandoni, Fabrizio
000121628 773__ $$j326$$tTheoretical Computer Science$$k1-3$$q57-67
000121628 909C0 $$xU11879$$0252111$$pDISOPT
000121628 909CO $$pSB$$particle$$ooai:infoscience.tind.io:121628
000121628 937__ $$aDISOPT-ARTICLE-2004-001
000121628 970__ $$a04438423861/DISOPT
000121628 973__ $$rREVIEWED$$sPUBLISHED$$aOTHER
000121628 980__ $$aARTICLE