1729 search results - page 51 / 346 » Bound Graph Polysemy |
154
click to vote
DM
2002
15 years 4 months ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
143
Voted
WABI
2007
Springer
15 years 10 months ago
2007
Springer
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
124
Voted
CP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
134
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
120
click to vote
COCOA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...