1545 search results - page 151 / 309 » On tree congestion of graphs |
161
click to vote
APPROX
2007
Springer
16 years 19 days ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
179
click to vote
ICCS
2004
Springer
15 years 11 months ago
2004
Springer
The Knowledge Agent Mediation Language (KNAML) is designed for use in multi-agent reasoning systems. Like conceptual graphs, KNAML represents knowledge using concepts, relations, a...
174
click to vote
UAI
2004
15 years 7 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
159
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
142
click to vote
DAM
2008
15 years 6 months ago
2008
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf po...