2487 search results - page 204 / 498 » Partitions of Graphs into Trees |
139
click to vote
CG
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
122
click to vote
CVGIP
2004
15 years 3 months ago
2004
Topological volume skeletonization is a novel approach for automating transfer function design in visualization by extracting the topological structure of a volume dataset. The sk...
129
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori...
143
click to vote
IJCM
2002
15 years 3 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
125
click to vote
SEMWEB
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Topic Maps and RDF are two independently developed paradigms and standards for the representation, interchange, and exploitation of model-based data on the web. Each para...