1952 search results - page 249 / 391 » Complete partitions of graphs |
168
click to vote
SIROCCO
1998
15 years 7 months ago
1998
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 ? SLIRS (Strict Linear Interval Routing Schemes) and 1...
188
click to vote
COLING
1990
15 years 7 months ago
1990
One of the issues of Artificial Intelligence is the transfer of the knowledge conveyed by Natural Language into formalisms that a computer can interpret. In the Natural Language P...
176
click to vote
ENTCS
2007
15 years 6 months ago
2007
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
184
click to vote
TSP
2008
15 years 6 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
177
click to vote
CAD
2000
Springer
15 years 6 months ago
2000
Springer
This paper presents a novel methodology for deriving the dynamic equations of mechatronic systems from component models that are represented as linear graphs. This work is part of...