212 search results - page 27 / 43 » Subgraph Isomorphism in Planar Graphs and Related Problems |
115
Voted
IS
2007
15 years 15 days ago
2007
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
106
Voted
ICSE
2008
IEEE-ACM
16 years 1 months ago
2008
IEEE-ACM
Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant c...
126
Voted
ECCB
2005
IEEE
15 years 6 months ago
2005
IEEE
Many areas of modern biology are concerned with the management, storage, visualization, comparison, and analysis of networks. For instance, networks are used to model signal trans...
103
click to vote
DAM
1999
15 years 7 days ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
96
Voted
SODA
1990
ACM
15 years 1 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...