Sciweavers

2125 search results - page 219 / 425
» On Graph Complexity
Sort
View
CN
2008
98views more  CN 2008»
15 years 3 months ago
Description and simulation of dynamic mobility networks
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
Antoine Scherrer, Pierre Borgnat, Eric Fleury, Jea...
FSTTCS
2010
Springer
15 years 1 months ago
Satisfiability of Acyclic and Almost Acyclic CNF Formulas
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
Sebastian Ordyniak, Daniël Paulusma, Stefan S...
STACS
2007
Springer
15 years 9 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom
ISCC
2008
IEEE
15 years 9 months ago
Scheduling high-rate sessions in Fractional Lambda Switching networks: Algorithm and analysis
This work addresses the high-rate session scheduling problem in Fractional Lambda Switching (FλS) networks. With its global phase synchronization and pipeline forwarding (PF) ope...
Thu-Huong Truong, Mario Baldi, Yoram Ofek
ITNG
2006
IEEE
15 years 9 months ago
Utilizing XML Schema for Describing and Querying Still Image Databases
In this paper, still images are modeled by hierarchical tree structures and object relational graphs. These modeling concepts can be described naturally using XML schema. We intro...
Kazem Taghva, Min Xu, Emma Regentova, Tom Nartker