Back to Results
First PageMeta Content
NP-complete problems / Topological sorting / Directed graph / Algorithm / Feedback arc set / Network theory / Shortest path problem / Graph theory / Mathematics / Theoretical computer science


Ranking Tournaments: Local Search and a New Algorithm TOM COLEMAN and ANTHONY WIRTH The University of Melbourne Ranking is a fundamental activity for organising and, later, understanding data. Advice of the
Add to Reading List

Document Date: 2015-05-04 03:09:24


Open Document

File Size: 267,58 KB

Share Result on Facebook

Company

ACM Inc. / /

Currency

USD / /

Event

Person Communication and Meetings / /

Facility

ANTHONY WIRTH The University of Melbourne Ranking / /

IndustryTerm

local search scheme / local search techniques / sensible algorithm / local-search algorithms / classic quicksort algorithm / triangledeletion algorithm / accompanied new algorithms / local search approach / approximation algorithm / search engines / considered algorithms / local-search technique / local search schemes / copyright/server / search algorithms / /

Organization

Australian Research Council / University of Melbourne Ranking / /

Person

TOM COLEMAN / ANTHONY WIRTH / /

Position

General / /

Technology

sensible algorithm / Graph algorithms / local-search algorithms / 2.4 Triangle-destroying algorithms / following algorithm / therefore considered algorithms / Triangle Count algorithm / Degree Difference algorithm / Eades algorithm / Triangle Delta algorithm / sorting algorithm / approximation algorithm / alternative algorithm / triangledeletion algorithm / classic quicksort algorithm / computational chemistry / Chanas algorithm / 2.5 Degree Difference algorithms / 2.2 Sorting algorithms / 2.3 Local search algorithms / FAS algorithm / /

SocialTag