Search

Skip to Search Results
  • 1998

    Kratsch, D., Stewart, Lorna

    Technical report TR98-06. In this paper, we examine the bandwidth problem in circular-arc graphs, chordal graphs with a bounded number of leaves in the clique tree, and k-polygon graphs (fixed k). All of these graph classes admit efficient approximation algorithms which are based on exact or...

  • 2006-08-14

    Fernyc, Jason W.

    Traffic prioritization and Quality of Service (QoS) are important components in the offering of network services and have enhanced importance when converged traffic transits the network. Each traffic type may place unique requirements on the network infrastructure. While this functionality can...

1 - 2 of 2