Sciweavers

1395 search results - page 3 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
IOR
2011
175views more  IOR 2011»
13 years 2 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....
PAKDD
2011
ACM
214views Data Mining» more  PAKDD 2011»
12 years 10 months ago
Spectral Analysis of k-Balanced Signed Graphs
Abstract. Previous studies on social networks are often focused on networks with only positive relations between individual nodes. As a significant extension, we conduct the spectr...
Leting Wu, Xiaowei Ying, Xintao Wu, Aidong Lu, Zhi...
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
13 years 7 months ago
On the Symmetry of the Distribution of k-Crossings and k-Nestings in Graphs
This note contains two results on the distribution of k-crossings and k-nestings in graphs. On the positive side, we exhibit a class of graphs for which there are as many k-noncro...
Anna de Mier
CORR
2011
Springer
149views Education» more  CORR 2011»
13 years 2 months ago
Solving k-Set Agreement with Stable Skeleton Graphs
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
Martin Biely, Peter Robinson, Ulrich Schmid
FCT
2009
Springer
13 years 11 months ago
Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
Thomas Thierauf, Fabian Wagner