Minimum flows in directed s-t planar networks with arcs and nodes capacities.
Eleonor CiureaOana GeorgescuCamelia SchiopuPublished in: CoDIT (2018)
Keyphrases
- network structure
- real world networks
- flow network
- neighboring nodes
- social networks
- network topologies
- complex networks
- betweenness centrality
- network nodes
- small world
- average degree
- missing links
- overlapping communities
- minimum cost
- information networks
- shortest path
- wireless ad hoc networks
- mobile nodes
- line segments
- directed graph
- computer networks
- graph structure
- origin destination
- network connectivity
- scale free
- planar graphs
- interconnection networks
- strongly connected
- link failure
- traffic patterns
- network model
- community structure
- scale free networks
- spanning tree
- end to end
- dominating set
- cohesive subgroups