3105 search results - page 24 / 621 » The Path-Packing Structure of Graphs |
111
Voted
DATESO
2004
15 years 1 months ago
2004
Discovering the complex relationships between entities is one way of benefitting from the Semantic Web. This paper discusses new approaches to implementing -operators into RDF quer...
120
Voted
TAMC
2010
Springer
14 years 11 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
105
click to vote
ICLA
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. Connection matrices of graph parameters were first introduced by M. Freedman, L. Lov
115
Voted
ICOIN
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
102
Voted
PUK
2000
15 years 1 months ago
2000
In this paper we discuss and describe preliminary results of integrating two strands of planning research - that of using plan graphs to speed up planning, and that of using object...