Sciweavers

Share
19 search results - page 2 / 4
» Convex p-partitions of bipartite graphs
Sort
View
TCS
2010
8 years 6 months ago
On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
Mauro Mezzini
ALGORITHMICA
2007
80views more  ALGORITHMICA 2007»
9 years 6 days ago
Tree Spanners for Bipartite Graphs and Probe Interval Graphs
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
Andreas Brandstädt, Feodor F. Dragan, Ho&agra...
MOR
2010
113views more  MOR 2010»
8 years 10 months ago
Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs
We consider the mixed integer version of bipartite vertex cover. This is equivalent to the mixed integer network dual model, recently introduced in [2], that generalizes several m...
Michele Conforti, Laurence A. Wolsey, Giacomo Zamb...
AAAI
2010
9 years 1 months ago
Propagating Conjunctions of AllDifferent Constraints
We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value...
Christian Bessiere, George Katsirelos, Nina Narody...
JGT
2008
107views more  JGT 2008»
9 years 1 days ago
On planar intersection graphs with forbidden subgraphs
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
János Pach, Micha Sharir
books