Sciweavers

990 search results - page 34 / 198
» Sub-Graphs of Complete Graph
Sort
View
JCO
1998
97views more  JCO 1998»
13 years 7 months ago
The Travelling Salesman Problem on Permuted Monge Matrices
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...
Rainer E. Burkard, Vladimir G. Deineko, Gerhard J....
PKDD
2005
Springer
145views Data Mining» more  PKDD 2005»
14 years 1 months ago
A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
Jinyan Li, Haiquan Li, Donny Soh, Limsoon Wong
BMCBI
2011
13 years 2 months ago
Hierarchical graphs for rule-based modeling of biochemical systems
Background: In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state...
Nathan W. Lemons, Bin Hu, William S. Hlavacek
TAMC
2009
Springer
14 years 2 days ago
Feasibility of Motion Planning on Directed Graphs
Because of irreversibility of movements, motion planning on directed graphs is much more intricate than that on graphs. Recently we showed that the feasibility of motion planning o...
Zhilin Wu, Stéphane Grumbach
ACL
1993
13 years 9 months ago
A Complete and Recursive Feature Theory
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
Rolf Backofen, Gert Smolka