Graph-Theoretic Concepts in Computer Science

@inproceedings{Kanade2015GraphTheoreticCI,
  title={Graph-Theoretic Concepts in Computer Science},
  author={Takeo Kanade and Josef Kittler and Friedemann Mattern and John C. Mitchell and Moni Naor and Israel C. Pandu Rangan and Bernhard Steffen and Gerhard Weikum},
  booktitle={Lecture Notes in Computer Science},
  year={2015}
}
In graph modification problems, one is given a graph G and the goal is to apply a minimum number of modification operations (such as edge deletions) to G such that the resulting graph fulfills a certain property. For example, the Cluster Deletion problem asks to delete as few edges as possible such that the resulting graph is a disjoint union of cliques. Graph modification problems appear in numerous applications, including the analysis of biological and social networks. Typically, graph… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 57 REFERENCES

Optimizing ROADM configuration in WDM networks

  • 2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)
  • 2014
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Shortest path problem with forbidden paths: The elementary version

  • European Journal of Operational Research
  • 2013
VIEW 22 EXCERPTS
HIGHLY INFLUENTIAL

Node-disjoint paths search in WDM networks with asymmetric nodes

  • 15th International Conference on Optical Network Design and Modeling - ONDM 2011
  • 2011
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Dynamic programming and planarity: Improved tree-decomposition based algorithms

  • Discrete Applied Mathematics
  • 2010
VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…