370 search results - page 30 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
128
click to vote
RSEISP
2007
Springer
15 years 8 months ago
2007
Springer
The current research in granular computing is dominated by set-theoretic models such as rough sets and fuzzy sets. By recasting the existing studies in a wider context, we propose ...
130
click to vote
COCO
2008
Springer
15 years 3 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
WSC
2004
15 years 3 months ago
2004
Simulation methods are extensively used in modeling complex scheduling problems. However, traditional layout of simulation models can become complicated when they are used to find...
106
click to vote
AINA
2010
IEEE
15 years 6 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
121
click to vote
ECCC
2008
15 years 2 months ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...