5889 search results - page 973 / 1178 » Graph Layout Problems |
140
Voted
ECCC
2010
15 years 1 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
126
click to vote
EUROMED
2010
2010
Architectural Heritage Online: Ontology-Driven Website Generation for World Heritage Sites in Danger
15 years 1 months ago
We introduce an online knowledge base for semantic representation and annotation of a world heritage site in danger. For this purpose we designed ontology inside the protégé tool...
113
Voted
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
124
Voted
MIAR
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract. This paper proposes a new method to compute connectivity information from diffusion weighted images. It is inspired by graphbased approaches to connectivity definition,...
106
Voted
MST
2010
15 years 1 months ago
2010
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...