Sciweavers

1952 search results - page 57 / 391
» Complete partitions of graphs
Sort
View
IPL
2007
130views more  IPL 2007»
15 years 3 months ago
Linear structure of bipartite permutation graphs and the longest path problem
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
Ryuhei Uehara, Gabriel Valiente
JGT
2007
130views more  JGT 2007»
15 years 3 months ago
Vertex partitions and maximum degenerate subgraphs
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
Martín Matamala
ICML
2003
IEEE
16 years 4 months ago
Transductive Learning via Spectral Graph Partitioning
We present a new method for transductive learning, which can be seen as a transductive version of the k nearest-neighbor classifier. Unlike for many other transductive learning me...
Thorsten Joachims
111
Voted
STOC
2006
ACM
77views Algorithms» more  STOC 2006»
16 years 4 months ago
Graph partitioning using single commodity flows
Rohit Khandekar, Satish Rao, Umesh V. Vazirani