3105 search results - page 319 / 621 » The Path-Packing Structure of Graphs |
166
click to vote
ICDCS
2002
IEEE
15 years 9 months ago
2002
IEEE
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
151
click to vote
METRICS
1999
IEEE
15 years 9 months ago
1999
IEEE
The design of software is often depicted by graphs that show components and their relationships. For example, a structure chart shows the calling relationships among components. O...
168
click to vote
SIGSOFT
1994
ACM
15 years 8 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
196
click to vote
AGTIVE
2007
Springer
15 years 8 months ago
2007
Springer
Meta-modeling is well known to define the basic concepts of domain-specific languages in an object-oriented way. Based on graph transformation, an abstract meta-model may be enhanc...
133
click to vote
COCO
2010
Springer
15 years 8 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...