Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Algorithmica

Search In Journal Title:

Abbravation: Algorithmica

Search In Journal Abbravation:

Publisher

Springer-Verlag

Search In Publisher:

DOI

10.1016/0148-9062(83)91255-x

Search In DOI:

ISSN

1432-0541

Search In ISSN:
Search In Title Of Papers:

Algorithms for the Homogeneous Set Sandwich Proble

Authors: Celina MH de Figueiredo Guilherme D da Fonseca Vinicius GP de Sa Jeremy Spinrad
Publish Date: 2006/05/10
Volume: 46, Issue: 2, Pages: 149-180
PDF Link

Abstract

A homogeneous set is a nontrivial module of a graph ie a nonempty nonunitary proper subset of a graphs vertices such that all its elements present exactly the same outer neighborhood Given two graphs G 1VE 1G 2VE 2 the Homogeneous Set Sandwich Problem HSSP asks whether there exists a sandwich graph G SVE S E 1 subseteq E S subseteq E 2 which has a homogeneous set In 2001 Tang et al published an allfast On2 triangle 2 algorithm which was recently proven wrong so that the HSSPs known upper bound would have been reset thereafter at the former On4 determined by Cerioli et al in 1998 We present notwithstanding new deterministic algorithms which have it established at On3 log m/n We give as well two even faster On3 randomized algorithms whose simplicity might lend them didactic usefulness We believe that besides providing efficient easytoimplement procedures to solve it the study of these new approaches allows a fairly thorough understanding of the problem

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. On Minimum Sum of Radii and Diameters Clustering
  2. Integer Representation and Counting in the Bit Probe Model
  3. An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization
  4. New Approximation Algorithms for Minimum Cycle Bases of Graphs
  5. The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases
  6. Aligning Two Convex Figures to Minimize Area or Perimeter
  7. Introduction for S.I. AofA14
  8. Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
  9. Detecting Regular Visit Patterns
  10. Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm
  11. Random Matrices and Codes for the Erasure Channel
  12. On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs
  13. The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology
  14. Optimal Parallel Quantum Query Algorithms
  15. Average Case Network Lifetime on an Interval with Adjustable Sensing Ranges
  16. Maximum Series-Parallel Subgraph
  17. A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties
  18. Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets
  19. The Parameterized Complexity of Local Search for TSP, More Refined
  20. Approximating Fixation Probabilities in the Generalized Moran Process
  21. Approximation Algorithms for Scheduling with Reservations
  22. A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
  23. Computing Minimum Cuts by Randomized Search Heuristics
  24. Constructing Labeling Schemes through Universal Matrices
  25. An Approximation Algorithm for the Minimum Co-Path Set Problem
  26. Scheduling with an Orthogonal Resource Constraint
  27. Approximate Boyer-Moore String Matching for Small Alphabets
  28. Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
  29. Between Treewidth and Clique-Width
  30. What’s the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid
  31. Multi-sided Boundary Labeling
  32. A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
Search Result: