Approximating rank-width and clique-width quickly
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2008/11/01
-
Journal
-
Indian UGC (journal)
-
Refrences26
-
Citations45
-
Sang-Il Oum KAIST, Daejeon, Republic of Korea
Abstract
Cite
Oum, Sang-Il. “Approximating Rank-Width and Clique-Width Quickly”. ACM Transactions on Algorithms, vol. 5, no. 1, 2008, pp. 1-20, https://doi.org/10.1145/1435375.1435385.
Oum, S.-I. (2008). Approximating rank-width and clique-width quickly. ACM Transactions on Algorithms, 5(1), 1-20. https://doi.org/10.1145/1435375.1435385
Oum, Sang-Il. “Approximating Rank-Width and Clique-Width Quickly”. ACM Transactions on Algorithms 5, no. 1 (2008): 1-20. https://doi.org/10.1145/1435375.1435385.
Oum SI. Approximating rank-width and clique-width quickly. ACM Transactions on Algorithms. 2008;5(1):1-20.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Combinatorial Mathematics: Proceedings of the 3rd International Conference | 1989 | |||
| Cycles and Rays (Montreal | 1987 | |||
| Proceedings of the 4th Latin American Symposium on Theoretical Informatics, Punta del Este, Uruguay. Lecture Notes in Computer Science | ||||
| Graph-Theoretic Concepts in Computer Science Boltenhagen. Lecture Notes in Computer Science | ||||
| Matroid Theory |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Succinct data structures for bounded clique-width graphs | Discrete Applied Mathematics |
| 2024 | |
Stability, Vertex Stability, and Unfrozenness for Special Graph Classes | Theory of Computing Systems |
| 2023 | |
Fair allocation algorithms for indivisible items under structured conflict constraints | Computational and Applied Mathematics |
| 2023 | |
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width | Algorithmica |
| 4 | 2022 |
Parameterized Complexity of Graph Burning | Algorithmica |
| 2022 |
Citations Analysis
The category
Science: Mathematics 25
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Clique-Width is NP-Complete and was published in 2009. The most recent citation comes from a 2024 study titled Succinct data structures for bounded clique-width graphs. This article reached its peak citation in 2022, with 7 citations. It has been cited in 19 different journals, 10% of which are open access. Among related journals, the Discrete Applied Mathematics cited this research the most, with 10 citations. The chart below illustrates the annual citation trends for this article.