OPTIMAL F-GRAPHS FOR THE FAMILY OF ALL K-SUBSETS OF AN N-SET.

Zbigniew Lonc; Tomasz Traczyk; Miroslaw Truszczynski

OPTIMAL F-GRAPHS FOR THE FAMILY OF ALL K-SUBSETS OF AN N-SET.

Zbigniew Lonc, Tomasz Traczyk, Miroslaw Truszczynski

Computer Science

Producción científica: Chapter › revisión exhaustiva

6 Citas (Scopus)

Resumen

In the combinatorial problem considered, the functional graph was proved to be asymptotically optimal over all directed paths in one case, and exactly optimal over directed trees in another case.

Idioma original	English
Título de la publicación alojada	Notes and Reports in Computer Science and Applied Mathematics
Páginas	247-270
Número de páginas	24
Estado	Published - 1983

ASJC Scopus subject areas

General Engineering

Otros archivos y enlaces

Citar esto

@inbook{417363793737401d821e67d4063a52d0,

title = "OPTIMAL F-GRAPHS FOR THE FAMILY OF ALL K-SUBSETS OF AN N-SET.",

abstract = "In the combinatorial problem considered, the functional graph was proved to be asymptotically optimal over all directed paths in one case, and exactly optimal over directed trees in another case.",

author = "Zbigniew Lonc and Tomasz Traczyk and Miroslaw Truszczynski",

year = "1983",

language = "English",

isbn = "0122818601",

pages = "247--270",

booktitle = "Notes and Reports in Computer Science and Applied Mathematics",

}

TY - CHAP

T1 - OPTIMAL F-GRAPHS FOR THE FAMILY OF ALL K-SUBSETS OF AN N-SET.

AU - Lonc, Zbigniew

AU - Traczyk, Tomasz

AU - Truszczynski, Miroslaw

PY - 1983

Y1 - 1983

N2 - In the combinatorial problem considered, the functional graph was proved to be asymptotically optimal over all directed paths in one case, and exactly optimal over directed trees in another case.

AB - In the combinatorial problem considered, the functional graph was proved to be asymptotically optimal over all directed paths in one case, and exactly optimal over directed trees in another case.

UR - http://www.scopus.com/inward/record.url?scp=0020927207&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020927207&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:0020927207

SN - 0122818601

SP - 247

EP - 270

BT - Notes and Reports in Computer Science and Applied Mathematics

ER -

OPTIMAL F-GRAPHS FOR THE FAMILY OF ALL K-SUBSETS OF AN N-SET.

Resumen

ASJC Scopus subject areas

Otros archivos y enlaces

Huella

Citar esto