Sciweavers

3268 search results - page 288 / 654
» The hub number of a graph
Sort
View
JCO
2007
97views more  JCO 2007»
15 years 6 months ago
Restricted domination parameters in graphs
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G) is an m-tuple dominating set if S dominates every vertex of G at least m times, and an m-dominating...
Wayne Goddard, Michael A. Henning
EMNLP
2010
15 years 4 months ago
Evaluating the Impact of Alternative Dependency Graph Encodings on Solving Event Extraction Tasks
In state-of-the-art approaches to information extraction (IE), dependency graphs constitute the fundamental data structure for syntactic structuring and subsequent knowledge elici...
Ekaterina Buyko, Udo Hahn
BCB
2010
166views Bioinformatics» more  BCB 2010»
15 years 1 months ago
Fast graph approaches to measure influenza transmission across geographically distributed host types
Recent advances in next generation sequencing are providing a number of large whole-genome sequence datasets stemming from globally distributed disease occurrences. This offers an...
Adrienne Breland, Karen Schlauch, Mehmet Hadi Gune...
ECCC
2011
205views ECommerce» more  ECCC 2011»
15 years 1 months ago
Graphs of Bounded Treewidth can be Canonized in AC1
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
Fabian Wagner
TIT
2011
109views more  TIT 2011»
15 years 1 months ago
On Achieving Local View Capacity Via Maximal Independent Graph Scheduling
—“If we know more, we can achieve more.” This adage also applies to networks, where more information about the network state translates into higher sum-rates. In this paper, ...
Vaneet Aggarwal, Amir Salman Avestimehr, Ashutosh ...