3105 search results - page 200 / 621 » The Path-Packing Structure of Graphs |
168
Voted
BMCBI
2006
15 years 3 months ago
2006
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...
159
click to vote
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
133
click to vote
CGO
2006
IEEE
15 years 9 months ago
2006
IEEE
Most programs are repetitive, where similar behavior can be seen at different execution times. Algorithms have been proposed that automatically group similar portions of a program...
114
click to vote
WG
2007
Springer
15 years 9 months ago
2007
Springer
NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the ...
138
Voted
TACAS
1997
Springer
15 years 7 months ago
1997
Springer
We present a highly polymorphic tool for the construction, synthesis, structuring, manipulation, investigation, and (symbolic) execution of graphs. The exibility of this tool, whic...