COCOON 2005 - PDF Preprint Papers

COCOON 2005 International Conference on Computing and Combinatorics

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COCOON-2005 Paper

click to vote

COCOON
2005
Springer

235views Combinatorics» more COCOON 2005»

A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem

14 years 2 months ago

Download www.cs.utk.edu

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...

W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, C...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	235	A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem	claim
2	198	Construction of Scale-Free Networks with Partial Information	claim
3	162	Genome Rearrangements with Partially Ordered Chromosomes	claim
4	156	Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis	claim
5	149	Fault-Tolerant Relay Node Placement in Wireless Sensor Networks	claim
6	147	On the Complexity of the Balanced Vertex Ordering Problem	claim
7	140	On the Approximation of Computing Evolutionary Trees	claim
8	138	Complexity and Approximation of Satisfactory Partition Problems	claim
9	132	Algorithms for Terminal Steiner Trees	claim
10	127	Error-Set Codes and Related Objects	claim
11	126	Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks	claim
12	125	Randomized Quicksort and the Entropy of the Random Source	claim
13	124	A Theoretical Upper Bound for IP-Based Floorplanning	claim
14	122	Bicriteria Network Design via Iterative Rounding	claim
15	120	Min-Energy Voltage Allocation for Tree-Structured Tasks	claim
16	120	Perfect Sorting by Reversals	claim
17	117	Angel, Devil, and King	claim
18	117	Algorithms for Finding Distance-Edge-Colorings of Graphs	claim
19	116	Promised and Distributed Quantum Search	claim
20	112	Improved Algorithms for the K-Maximum Subarray Problem for Small K	claim
21	111	A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm	claim
22	110	On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules	claim
23	106	Conditionally Critical Indecomposable Graphs	claim
24	105	Power Domination Problem in Graphs	claim
25	104	Interference in Cellular Networks: The Minimum Membership Set Cover Problem	claim
26	103	RIATA-HGT: A Fast and Accurate Heuristic for Reconstructing Horizontal Gene Transfer	claim
27	102	Radio Networks with Reliable Communication	claim
28	101	Solovay Reducibility on D-c.e Real Numbers	claim
29	100	Conserved Interval Distance Computation Between Non-trivial Genomes	claim
30	99	On Sequential and 1-Deterministic P Systems	claim
31	97	Finding Longest Increasing and Common Subsequences in Streaming Data	claim
32	97	On-Line Algorithms for Market Equilibria	claim
33	96	Interval Subset Sum and Uniform-Price Auction Clearing	claim
34	96	Share the Multicast Payment Fairly	claim
35	95	A PTAS for a Disc Covering Problem Using Width-Bounded Separators	claim
36	92	Exploring Simple Grid Polygons	claim
37	91	New Streaming Algorithms for Counting Triangles in Graphs	claim
38	91	A New Algorithm for the Hypergraph Transversal Problem	claim
39	90	Bounded Degree Closest k-Tree Power Is NP-Complete	claim
40	90	Distributed Weighted Vertex Cover via Maximal Matchings	claim
41	88	The Money Changing Problem Revisited: Computing the Frobenius Number in Time O(k a1)	claim
42	88	A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees	claim
43	88	The Reverse Greedy Algorithm for the Metric K-Median Problem	claim
44	87	Rapid Homology Search with Two-Stage Extension and Daughter Seeds	claim
45	86	A Tight Analysis of the Maximal Matching Heuristic	claim
46	86	Server Allocation Algorithms for Tiered Systems	claim
47	86	On the Power of Lookahead in On-Line Vehicle Routing Problems	claim
48	82	On Walrasian Price of CPU Time	claim
49	81	Opportunistic Data Structures for Range Queries	claim
50	79	Smoothed Analysis of Algorithms and Heuristics	claim
51	78	String Coding of Trees with Locality and Heritability	claim
52	78	Quartet-Based Phylogeny Reconstruction from Gene Orders	claim
53	77	On Packing and Coloring Hyperedges in a Cycle	claim
54	77	Some New Results on Inverse Sorting Problems	claim
55	76	Radial Coordinate Assignment for Level Graphs	claim
56	76	Oblivious and Adaptive Strategies for the Majority and Plurality Problems	claim
57	73	RNA Multiple Structural Alignment with Longest Common Subsequences	claim
58	67	An Upper Bound on the Number of Rectangulations of a Point Set	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers