1. Home
  2. Issues
  3. Volume 18, Issue 3 (2007)
  4. Recognition Algorithm for Diamond-Free G ...

Informatica


Cited by 7
Recognition Algorithm for Diamond-Free Graphs

Graph-Based Data Clustering with Overlaps
Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
https://doi.org/10.1007/978-3-642-02882-3_51
Book:  Lecture Notes in Computer Science (Computing and Combinatorics) Volume 5609 (2009), p. 516
On the Min-Max 2-Cluster Editing Problem
Li-Hsuan Chen, Maw-Shang Chang, Chun-Chieh Wang, Bang Ye Wu
https://doi.org/10.1007/978-3-642-35452-6_16
Book:  Smart Innovation, Systems and Technologies (Advances in Intelligent Systems and Applications - Volume 1) Volume 20 (2013), p. 133
A Recognition Algorithm and Some Optimization Problems on Weakly Quasi-Threshold Graphs
Mihai Talmaciu
https://doi.org/10.1007/978-3-319-00467-9_18
Book:  Studies in Computational Intelligence (Advanced Intelligent Computational Technologies and Decision Support Systems) Volume 486 (2014), p. 211
On Confidentially Connected-Free Graphs
Mihai Talmaciu, Elena Nechita, Barna Iantovics
https://doi.org/10.1007/978-3-319-00029-9_16
Book:  Studies in Computational Intelligence (Advances in Intelligent Analysis of Medical Data and Decision Support Systems) Volume 473 (2013), p. 179
Arboricity, h-index, and dynamic algorithms
Min Chih Lin, Francisco J. Soulignac, Jayme L. Szwarcfiter
https://doi.org/10.1016/j.tcs.2011.12.006
Journal:  Theoretical Computer Science Volume 426-427 (2012), p. 75
Graph-based data clustering with overlaps
Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
https://doi.org/10.1016/j.disopt.2010.09.006
Journal:  Discrete Optimization Volume 8, Issue 1 (2011), p. 2
Recognition and Optimization Algorithms for P5-Free Graphs
Mihai Talmaciu, Luminiţa Dumitriu, Ioan Şuşnea, Victor Lepin, László Barna Iantovics
https://doi.org/10.3390/sym12020304
Journal:  Symmetry Volume 12, Issue 2 (2020), p. 304


Share


RSS