Sciweavers

2283 search results - page 110 / 457
» Bounds of Graph Characteristics
Sort
View
ALGORITHMICA
2002
116views more  ALGORITHMICA 2002»
15 years 3 months ago
Budget Management with Applications
Given a directed acyclic graph with timing constraints, the budget management problem is to assigntoeachvertexanincrementaldelaysuchthatthesumofthesedelaysismaximizedwithoutviolati...
Chunhong Chen, Elaheh Bozorgzadeh, Ankur Srivastav...
STOC
2006
ACM
114views Algorithms» more  STOC 2006»
16 years 3 months ago
Linear time low tree-width partitions and algorithmic consequences
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
Jaroslav Nesetril, Patrice Ossona de Mendez
133
Voted
FOCS
2009
IEEE
15 years 10 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
CORR
2007
Springer
149views Education» more  CORR 2007»
15 years 3 months ago
Graph Entropy, Network Coding and Guessing games
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
Søren Riis
140
Voted
AMAI
2004
Springer
15 years 9 months ago
Improving Exact Algorithms for MAX-2-SAT
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
Haiou Shen, Hantao Zhang