Sciweavers

990 search results - page 37 / 198
» Sub-Graphs of Complete Graph
Sort
View
IPL
2007
121views more  IPL 2007»
13 years 7 months ago
Parameterized complexity of the induced subgraph problem in directed graphs
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
Venkatesh Raman, Somnath Sikdar
CIKM
2009
Springer
14 years 2 months ago
Completing wikipedia's hyperlink structure through dimensionality reduction
Wikipedia is the largest monolithic repository of human knowledge. In addition to its sheer size, it represents a new encyclopedic paradigm by interconnecting articles through hyp...
Robert West, Doina Precup, Joelle Pineau
ALGORITHMICA
2010
147views more  ALGORITHMICA 2010»
13 years 7 months ago
Note on the Structure of Kruskal's Algorithm
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
Nicolas Broutin, Luc Devroye, Erin McLeish
DM
2006
107views more  DM 2006»
13 years 7 months ago
On a new reformulation of Hadwiger's conjecture
Assuming that every proper minor closed class of graphs contains a maximum with respect to the homomorphism order, we prove that such a maximum must be homomorphically equivalent ...
Reza Naserasr, Yared Nigussie
MOR
2010
113views more  MOR 2010»
13 years 6 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...