A polynomial algorithm for finding T-span of generalized cacti. - Publication - Bridge of Knowledge

A polynomial algorithm for finding T-span of generalized cacti.

Abstract

W pracy opisano wielomianowy algorytm wyznaczający optymalne T-pokolorowania dla uogólnionych kaktusów.

Authors (3)

Cite as

Full text

download paper

downloaded 29 times

Publication version: Accepted or Published Version
License: Copyright (2003 Elsevier B.V)

full content of the article see on external site open in new tab

Keywords

Details

Category:: Articles
Type:: artykuł w czasopiśmie z listy filadelfijskiej
Published in:: DISCRETE APPLIED MATHEMATICS pages 371 - 382,
ISSN: 0166-218X
Language:: English
Publication year:: 2003
Bibliographic description:: Giaro K., Janczewski R., Małafiejski M.: A polynomial algorithm for finding T-span of generalized cacti. // DISCRETE APPLIED MATHEMATICS. -., nr. 129 (2003), s.371-382
Verified by:: Gdańsk University of Technology

seen 101 times