5100 search results - page 160 / 1020 » The Linear Complexity of a Graph |
INFOCOM
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
ICDAR
1995
IEEE
14 years 1 months ago
1995
IEEE
This paper describes substantial advances in the analysis (parsing) of diagrams using constraint grammars. The addition of set types to the grammar and spatial indexing of the dat...
APSEC
2005
IEEE
14 years 4 months ago
2005
IEEE
The design and development of complex software systems is a difficult task, and it is not easy to ensure the quality of a developed software. The paper presents an architectural ...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
MFCS
1995
Springer
14 years 1 months ago
1995
Springer
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...