Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

JUCS
2007

favoriteEmaildiscussreport

117views more JUCS 2007»

Connectivity and Reachability in Signed Networks

13 years 4 months ago

Connectivity and Reachability in Signed Networks

Download www.jucs.org

: For modeling real-life situations where not only the intensity of the relation existing between elements but also its polarity is important, we have proposed (see [Marcus and Tataram 1987a]) a new type of graphs: the signed networks. In the present paper we study two of thier most important properties: connectivity and reachability, and try to use them in order to oﬀer a strategy to improve communication in social or professional groups. Key Words: graph theory, connectivity, geodesics Category: G.2.2, G.2.3

Monica Tataram

Real-time Traffic

Important Properties | JUCS 2007 | Present Paper | Real-life Situations |

claim paper

Related Content

» Distributed Tree Rearrangements for Reachability and Robust Connectivity

» Characterization of a Connectivity Measure for Sparse Wireless Multihop Networks

» Adaptive navigation support with public displays

» High capacity associative memories and connection constraints

» Characterising temporal distance and reachability in mobile and online social networks

» Recursive Computation of Regions and Connectivity in Networks

» Temporal reachability graphs

» Spectral Analysis of kBalanced Signed Graphs

» Computing labelconstraint reachability in graph databases

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2007
Where	JUCS
Authors	Monica Tataram

Comments (0)