Record Details

Realization of set functions as cut functions of graphs and hypergraphs

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Realization of set functions as cut functions of graphs and hypergraphs
 
Creator FUJISHIGE, S
PATKAR, SB
 
Subject selection problem
 
Description We consider the problems of realizing set functions as cut functions on graphs and hypergraphs. We give necessary and sufficient conditions for set functions to be realized as cut functions on nonnegative networks, symmetric networks and nonnegative hypernetworks. The symmetry significantly simplifies the characterization of set functions of nonnegative network type. Set functions of nonnegative hypernetwork type generalize those of nonnegative network type (cut functions of ordinary networks) and are submodular functions. For any constant integer k greater than or equal to2, we can discern in polynomial time by a max-flow algorithm whether a given set function of order k is of nonnegative hypernetwork type. (C) 2001 .
 
Publisher ELSEVIER SCIENCE BV
 
Date 2011-07-26T13:26:21Z
2011-12-26T12:54:34Z
2011-12-27T05:42:38Z
2011-07-26T13:26:21Z
2011-12-26T12:54:34Z
2011-12-27T05:42:38Z
2001
 
Type Article
 
Identifier DISCRETE MATHEMATICS, 226(1-3), 199-210
0012-365X
http://dx.doi.org/10.1016/S0012-365X(00)00164-3
http://dspace.library.iitb.ac.in/xmlui/handle/10054/6916
http://hdl.handle.net/10054/6916
 
Language en