Sciweavers

496 search results - page 28 / 100
» C4-saturated bipartite graphs
Sort
View
WWW
2008
ACM
16 years 2 months ago
Behavioral classification on the click graph
A bipartite query-URL graph, where an edge indicates that a document was clicked for a query, is a useful construct for finding groups of related queries and URLs. Here we use thi...
Martin Szummer, Nick Craswell
CPC
2010
116views more  CPC 2010»
14 years 11 months ago
A Separator Theorem for String Graphs and its Applications
A string graph is the intersection graph of a collection of continuous arcs in the plane. It is shown that any string graph with m edges can be separated into two parts of roughly...
Jacob Fox, János Pach
SIAMDM
2008
84views more  SIAMDM 2008»
15 years 1 months ago
Long Local Searches for Maximal Bipartite Subgraphs
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vert...
Hemanshu Kaul, Douglas B. West
FOCS
2003
IEEE
15 years 7 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
IPL
2006
139views more  IPL 2006»
15 years 1 months ago
An adjustable linear time parallel algorithm for maximum weight bipartite matching
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
Morteza Fayyazi, David R. Kaeli, Waleed Meleis