Sciweavers

496 search results - page 35 / 100
» C4-saturated bipartite graphs
Sort
View
ESA
2011
Springer
251views Algorithms» more  ESA 2011»
12 years 7 months ago
Improved Approximation Algorithms for Bipartite Correlation Clustering
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke...
DAC
2007
ACM
14 years 8 months ago
Program Mapping onto Network Processors by Recursive Bipartitioning and Refining
Mapping packet processing applications onto embedded network processors (NP) is a challenging task due to the unique constraints of NP systems and the characteristics of network a...
Jia Yu, Jingnan Yao, Jun Yang 0002, Laxmi N. Bhuya...
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
11 years 10 months ago
Robust Reputation-Based Ranking on Bipartite Rating Networks
With the growth of the Internet and E-commerce, bipartite rating networks are ubiquitous. In such bipartite rating networks, there exist two types of entities: the users and the o...
Rong-Hua Li, Jeffrey Xu Yu, Xin Huang, Hong Cheng
DM
2010
143views more  DM 2010»
13 years 7 months ago
Acyclic improper colourings of graphs with bounded maximum degree
For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour cl...
Louigi Addario-Berry, Louis Esperet, Ross J. Kang,...
DM
1999
101views more  DM 1999»
13 years 7 months ago
Characterizations of bipartite Steinhaus graphs
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...
Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dym&ag...