Sciweavers

117 search results - page 21 / 24
» Graphs with Chromatic Roots in the Interval (1, 2)
Sort
View
COCOON
2009
Springer
14 years 1 months ago
Convex Recoloring Revisited: Complexity and Exact Algorithms
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
Iyad A. Kanj, Dieter Kratsch
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
14 years 1 months ago
Pricing Tree Access Networks with Connected Backbones
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. R...
ICDCS
2002
IEEE
14 years 10 days ago
dRBAC: Distributed Role-based Access Control for Dynamic Coalition Environments
Distributed Role-Based Access Control (dRBAC) is a scalable, decentralized trust-management and accesscontrol mechanism for systems that span multiple administrative domains. dRBA...
Eric Freudenthal, Tracy Pesin, Lawrence Port, Edwa...
EJC
2007
13 years 7 months ago
Deterministic random walks on the integers
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 7 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr