721 search results - page 135 / 145 » Bounds on the k-domination number of a graph |
STACS
2007
Springer
15 years 5 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
123
click to vote
WAW
2004
Springer
15 years 5 months ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
116
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
118
click to vote
DIALM
2005
ACM
15 years 1 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...