2487 search results - page 98 / 498 » Partitions of Graphs into Trees |
147
Voted
IROS
2009
IEEE
15 years 12 months ago
2009
IEEE
— We present a method for topological SLAM that specifically targets loop closing for edge-ordered graphs. Instead of using a heuristic approach to accept or reject loop closing...
135
Voted
PAKDD
2004
ACM
15 years 10 months ago
2004
ACM
We introduce a numerical measure on sets of partitions of finite sets that is linked to the Goodman-Kruskal association index commonly used in statistics. This measure allows us t...
148
Voted
CSR
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
150
click to vote
DM
2002
15 years 5 months ago
2002
We disprove a conjecture of Bultena and Ruskey [1], that all trees which are cyclic graphs of cyclic Gray codes have diameter 2 or 4, by producing codes whose cyclic graphs are tre...
185
click to vote
BDA
2004
15 years 6 months ago
2004
XQuery is the emerging standard for querying XML data sources. XLive is a light XML/XQuery mediator developed at University of Versailles whose engine processes an XML algebra der...