Sciweavers

496 search results - page 13 / 100
» C4-saturated bipartite graphs
Sort
View
GECCO
2008
Springer
140views Optimization» more  GECCO 2008»
13 years 8 months ago
A bivariate probabilistic model-building genetic algorithm for graph bipartitioning
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
Dirk Thierens
ARSCOM
2007
77views more  ARSCOM 2007»
13 years 7 months ago
Extremal bipartite graphs with high girth
Let us denote by EX (m, n; {C4, . . . , C2t}) the family of bipartite graphs G with m and n vertices in its classes that contain no cycles of length less than or equal to 2t and h...
Camino Balbuena, Pedro García-Vázque...
DAM
2010
107views more  DAM 2010»
13 years 7 months ago
Codes from lattice and related graphs, and permutation decoding
Codes of length n2 and dimension 2n - 1 or 2n - 2 over the field Fp, for any prime p, that can be obtained from designs associated with the complete bipartite graph Kn,n and its l...
Jennifer D. Key, Bernardo Gabriel Rodrigues
ESA
2008
Springer
142views Algorithms» more  ESA 2008»
13 years 9 months ago
Edge Coloring and Decompositions of Weighted Graphs
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
Uriel Feige, Mohit Singh
CORR
2008
Springer
131views Education» more  CORR 2008»
13 years 7 months ago
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
Samir Datta, Raghav Kulkarni, Sambuddha Roy