2612 search results - page 321 / 523 » Switching Graphs and Their Complexity |
142
click to vote
ACSD
1998
IEEE
15 years 9 months ago
1998
IEEE
The development of an interactive application is a complex task that has to consider data, behavior, intercommunication, architecture and distribution aspects of the modeled syste...
142
click to vote
RT
1999
Springer
15 years 9 months ago
1999
Springer
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
144
click to vote
STACS
1994
Springer
15 years 9 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
162
click to vote
CADE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Heterogeneous specification becomes more and more important because complex systems are often specified using multiple viewpoints, involving multiple formalisms. Moreover...
182
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...