Sciweavers

2125 search results - page 156 / 425
» On Graph Complexity
Sort
View
69
Voted
CORR
2010
Springer
58views Education» more  CORR 2010»
14 years 8 months ago
Realizable Paths and the NL vs L Problem
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
Shiva Kintali
121
Voted
COMGEO
2012
ACM
13 years 5 months ago
Algorithms for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
Sergio Cabello, Éric Colin de Verdiè...
IWDC
2004
Springer
139views Communications» more  IWDC 2004»
15 years 3 months ago
Statistical Analysis of a P2P Query Graph Based on Degrees and Their Time-Evolution
Abstract. Despite their crucial impact on the performances of p2p systems, very few is known on peers behaviors in such networks. We propose here a study of these behaviors in a ru...
Jean-Loup Guillaume, Matthieu Latapy, Stevens Le-B...
IPPS
1997
IEEE
15 years 2 months ago
Optimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task Graphs
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
Theodore Andronikos, Nectarios Koziris, George K. ...
100
Voted
DBSEC
2009
124views Database» more  DBSEC 2009»
14 years 11 months ago
Towards System Integrity Protection with Graph-Based Policy Analysis
Abstract. Identifying and protecting the trusted computing base (TCB) of a system is an important task, which is typically performed by designing and enforcing a system security po...
Wenjuan Xu, Xinwen Zhang, Gail-Joon Ahn