Sciweavers

441 search results - page 62 / 89
» Convex Graph Invariants
Sort
View
PROCEDIA
2010
344views more  PROCEDIA 2010»
13 years 6 months ago
Towards high-quality, untangled meshes via a force-directed graph embedding approach
High quality meshes are crucial for the solution of partial differential equations (PDEs) via the finite element method (or other PDE solvers). The accuracy of the PDE solution,...
Sanjukta Bhowmick, Suzanne M. Shontz
PODC
2012
ACM
11 years 10 months ago
Iterative approximate byzantine consensus in arbitrary directed graphs
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang
INFOCOM
2006
IEEE
14 years 1 months ago
Wealth-Based Evolution Model for the Internet AS-Level Topology
— In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to tradition...
Xiaoming Wang, Dmitri Loguinov
FM
1999
Springer
161views Formal Methods» more  FM 1999»
13 years 12 months ago
On-the-Fly Controller Synthesis for Discrete and Dense-Time Systems
We present novel techniques for efficient controller synthesis for untimed and timed systems with respect to invariance and reachability properties. In the untimed case, we give al...
Stavros Tripakis, Karine Altisen
EJC
2008
13 years 7 months ago
Grad and classes with bounded expansion II. Algorithmic aspects
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
Jaroslav Nesetril, Patrice Ossona de Mendez