Back to Results
First PageMeta Content
Graph operations / Clique / Bron–Kerbosch algorithm / Maximal independent set / Independent set / Line graph / Clique-sum / Graph theory / Theoretical computer science / NP-complete problems


doi:[removed]j.tcs[removed]
Add to Reading List

Document Date: 2011-11-19 02:39:01

Open Document

File Size: 299,64 KB

Share Result on Facebook

City

Tokyo / /

Company

Elsevier B.V. / Toyota Techno Service Corporation / /

Country

Japan / /

/

IndustryTerm

search forest / depth-first search algorithm / diverse applications / printing / efficient algorithm / search trees / basic algorithm / /

MarketIndex

DIMACS / /

OperatingSystem

Linux / /

Organization

University of Electro-Communications / Department of Information and Communication Engineering / /

Person

Akira Tanakaa / /

Position

Corresponding author / /

ProgrammingLanguage

C / /

PublishedMedium

Theoretical Computer Science / /

Technology

depth-first search algorithm / efficient algorithm / bioinformatics / Kerbosch algorithm / Linux / time algorithm / basic algorithm / /

URL

www.elsevier.com/locate/tcs / /

SocialTag