Premium
Embedding of cycles and wheels into arbitrary trees
Author(s) -
Rajasingh Indra,
William Albert,
Quadras Jasintha,
Manuel Paul
Publication year - 2004
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20027
Subject(s) - embedding , enhanced data rates for gsm evolution , measure (data warehouse) , combinatorics , property (philosophy) , mathematics , computer science , discrete mathematics , tree (set theory) , mathematical optimization , artificial intelligence , philosophy , epistemology , database
We estimate and characterize the edge congestion‐sum measure for embeddings of various graphs such as cycles, wheels, and generalized wheels into arbitrary trees. All embedding algorithms apply an interesting general technique based on the consecutive label property. Our algorithms produce optimal values of sum of dilations and sum of edge‐congestions in linear time. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44(3), 173–178 2004