Sciweavers

1149 search results - page 76 / 230
» Minimally non-Pfaffian graphs
Sort
View
STACS
2009
Springer
15 years 6 months ago
The Price of Anarchy in Cooperative Network Creation Games
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid M...
IEEECIT
2010
IEEE
14 years 10 months ago
CFCSS without Aliasing for SPARC Architecture
With the increasing popularity of COTS (commercial off the shelf) components and multi-core processor in space and aviation applications, software fault tolerance becomes attracti...
Chao Wang, Zhongchuan Fu, Hongsong Chen, Wei Ba, B...
GD
2000
Springer
15 years 3 months ago
GRIP: Graph dRawing with Intelligent Placement
Abstract. This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The GRIP system is designed for drawing large graphs and uses a novel multi-dimensional ...
Pawel Gajer, Stephen G. Kobourov
ISCAPDCS
2003
15 years 1 months ago
Heterogeneous Hardware-Software System Partitioning using Extended Directed Acyclic Graph
In this paper, we present a system partitioning technique in which the input system specification is based on C++ language. The proposed technique processes data and precedence de...
Matthew Jin, Gul N. Khan
ISBRA
2009
Springer
15 years 6 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...