✦ LIBER ✦

In-place algorithms for computing a largest clique in geometric intersection graphs

✍ Scribed by De, Minati; Nandy, Subhas C.; Roy, Sasanka

Book ID: 127209506
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 551 KB
Volume: 178
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.06.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear-time algorithm for computing th

A linear-time algorithm for computing the intersection of all odd cycles in a graph

✍ Leizhen Cai; Baruch Schieber 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 506 KB

We present a linear-time algorithm that finds all edges and vertices in the intersection of all odd cycles in a given graph. We also show an application of our algorithm to a variant of the satisfiability problem of Boolean formulas.

[Communications in Computer and Informat

[Communications in Computer and Information Science] Innovative Computing Technology Volume 241 || A Distributed Algorithm for γ-Quasi-Clique Extractions in Massive Graphs

✍ Pichappan, Pit; Ahmadi, Hojat; Ariwa, Ezendu 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 245 KB

Recognition algorithm for intersection g

Recognition algorithm for intersection graphs of edge disjoint paths in a tree

✍ B.S. Panda; S.P. Mohanty 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 513 KB

An algorithm for computing all paths in

An algorithm for computing all paths in a graph

✍ Lars-Erik Thorelli 📂 Article 📅 1966 🏛 Springer Netherlands 🌐 English ⚖ 157 KB

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 1017 || A dynamic algorithm for line graph recognition

✍ Nagl, Manfred 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 518 KB

Distribution of Distances and Triangles

Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets

✍ Akutsu, T.; Tamaki, H.; Tokuyama, T. 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 312 KB