Results 1  10
of
1,884
Network information flow
 IEEE TRANS. INFORM. THEORY
, 2000
"... We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information source ..."
Abstract

Cited by 1961 (24 self)
 Add to MetaCart
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information
An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1993
"... AbstractA novel graph theoretic approach for data clustering is presented and its application to the image segmentation problem is demonstrated. The data to be clustered are represented by an undirected adjacency graph G with arc capacities assigned to reflect the similarity between the linked vert ..."
Abstract

Cited by 351 (0 self)
 Add to MetaCart
vertices. Clustering is achieved by removing arcs of G to form mutually exclusive subgraphs such that the largest intersubgraph maximum flow is minimized. For graphs of moderate size ( 2000 vertices), the optimal solution is obtained through partitioning a flow and cut equivalent tree of 6, which can
A Partial KArboretum of Graphs With Bounded Treewidth
 J. Algorithms
, 1998
"... The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be seen to have a uniform upper bound on the treewidth of graphs in the class. Also, some mutual relations between such classes ..."
Abstract

Cited by 328 (34 self)
 Add to MetaCart
The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be seen to have a uniform upper bound on the treewidth of graphs in the class. Also, some mutual relations between such classes are discussed.
Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Bounded Treewidth
, 1998
"... We show that if a flow network has k input/output terminals (for the traditional maximumflow problem, k = 2), its external flow pattern (the possible values of flow into and out of the terminals) has two characterizations of size independent of the total number of vertices: a set of 2 k + 1 inequ ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
We show that if a flow network has k input/output terminals (for the traditional maximumflow problem, k = 2), its external flow pattern (the possible values of flow into and out of the terminals) has two characterizations of size independent of the total number of vertices: a set of 2 k + 1
MONOTONE MULTITERMINAL RESISTORS AND LARGE NETWORKS
, 2002
"... Abstract. We show how the set of strongly monotone and Lipschitz multiterminal resistors is closed under forming networks and choosing terminals. We show that an infinite network of multiterminal resistors can serve as an approximation for all large finite subnetworks. We show that we may obtain th ..."
Abstract
 Add to MetaCart
Abstract. We show how the set of strongly monotone and Lipschitz multiterminal resistors is closed under forming networks and choosing terminals. We show that an infinite network of multiterminal resistors can serve as an approximation for all large finite subnetworks. We show that we may obtain
AN INTELLIGENT MULTITERMINAL INTERFACE by
, 1987
"... This material represents the author's original work except where specific acknowledgement is made, and has not been submitted in part, or in whole, to any other University for degree purposes. 11 Acknowledgements My thanks go to my supervisor Professor Lee Nattrass, not only for his guidance du ..."
Abstract
 Add to MetaCart
This material represents the author's original work except where specific acknowledgement is made, and has not been submitted in part, or in whole, to any other University for degree purposes. 11 Acknowledgements My thanks go to my supervisor Professor Lee Nattrass, not only for his guidance during the course of the project, but also for allowing me the time to do the work when the departmental lecturing load has been so high. I also thank him for his patience while waiting for me to complete the thesis which has been awaiting final proof reading for far too long. Thanks also go to my colleagues Dave Levy and Nils Otte who suffered my ministrations to their computer systems while 1 was debugging the RMUX interface software. Thanks also for their show of faith in using so many of the final units. Special thanks must also go to my wife Eleanor for her encouragement,
EMBEDDING kOUTERPLANAR GRAPHS INTO ℓ1
, 2006
"... We show that the shortestpath metric of any kouterplanar graph, for any fixed k, can be approximated by a probability distribution over tree metrics with constant distortion and hence also embedded into ℓ1 with constant distortion. These graphs play a central role in polynomial time approximation ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
schemes for many NPhard optimization problems on general planar graphs and include the family of weighted k × n planar grids. This result implies a constant upper bound on the ratio between the sparsest cut and the maximum concurrent flow in multicommodity networks for kouterplanar graphs, thus
Results 1  10
of
1,884