Sciweavers

3268 search results - page 189 / 654
» The hub number of a graph
Sort
View
DM
1999
61views more  DM 1999»
15 years 6 months ago
On an equivalence in discrete extremal problems
We introduce some equivalence relations on graphs and posets and prove that they are closed under the cartesian product operation. These relations concern the edge-isoperimetric p...
Sergei L. Bezrukov
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
15 years 4 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
CORR
2011
Springer
141views Education» more  CORR 2011»
15 years 1 months ago
Geometric Semigroup Theory
Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show h...
Jon McCammond, John Rhodes, Benjamin Steinberg
DAC
2008
ACM
16 years 7 months ago
Faster symmetry discovery using sparsity of symmetries
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
Paul T. Darga, Karem A. Sakallah, Igor L. Markov
APPROX
2007
Springer
115views Algorithms» more  APPROX 2007»
16 years 22 days ago
Improved Approximation Algorithms for the Spanning Star Forest Problem
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad...