|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 40 occurrences of 29 keywords
|
|
|
Results
Found 55 publication records. Showing 55 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
130 | Daniel Lokshtanov, Federico Mancini 0001, Charis Papadopoulos |
Characterizing and Computing Minimal Cograph Completions. |
FAW |
2008 |
DBLP DOI BibTeX RDF |
|
83 | Van Bang Le, H. N. de Ridder |
Characterisations and Linear-Time Recognition of Probe Cographs. |
WG |
2007 |
DBLP DOI BibTeX RDF |
|
68 | Stavros D. Nikolopoulos, Leonidas Palios |
Adding an Edge in a Cograph. |
WG |
2005 |
DBLP DOI BibTeX RDF |
cotrees, co-connected components, optimization problems, connected components, Perfect graphs, cographs |
68 | Volker Diekert, Paul Gastin |
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets. |
LPAR |
2001 |
DBLP DOI BibTeX RDF |
concurrency, Temporal logics, Mazurkiewicz traces |
62 | Rong Lin, Stephan Olariu |
Fast Parallel Algorithms for Cographs. |
FSTTCS |
1990 |
DBLP DOI BibTeX RDF |
|
48 | Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno |
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. |
J. Comput. Sci. Technol. |
2009 |
DBLP DOI BibTeX RDF |
algorithmic graph theory, cograph, prefix tree, distance-hereditary graph, tree representation |
48 | Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno |
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. |
TAMC |
2007 |
DBLP DOI BibTeX RDF |
algorithmic graph theory, cograph, prefix tree, distance-hereditary graph, tree representation |
48 | Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger |
Radio Labeling with Pre-assigned Frequencies. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
Radio labeling, k-colorling, computational complexity, approximation algorithm, graph algorithms, frequency assignment, cograph |
48 | Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul |
A Simple Linear Time LexBFS Cograph Recognition Algorithm. |
WG |
2003 |
DBLP DOI BibTeX RDF |
|
41 | Christophe Crespelle, Christophe Paul |
Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
41 | Rong Lin, Stephan Olariu |
An optimal parallel matching algorithm for cographs. |
SPDP |
1991 |
DBLP DOI BibTeX RDF |
|
41 | Hans L. Bodlaender, Rolf H. Möhring |
The Pathwidth and Treewidth of Cographs. |
SWAT |
1990 |
DBLP DOI BibTeX RDF |
|
27 | Richard B. Borie, R. Gary Parker, Craig A. Tovey |
Solving problems on recursively constructed graphs. |
ACM Comput. Surv. |
2008 |
DBLP DOI BibTeX RDF |
Halin graph, branchwidth, cliquewidth, cutwidth, rankwidth, series parallel, dynamic programming, tree, Bandwidth, treewidth, cograph, pathwidth |
27 | Marc Tedder, Derek G. Corneil |
An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
graph recognition, distance-hereditary, dynamic algorithm, cograph |
27 | Gerard J. Chang, Chiuyuan Chen, Yaping Chen |
Vertex and Tree Arboricities of Graphs. |
J. Comb. Optim. |
2004 |
DBLP DOI BibTeX RDF |
arboricity, block-cactus graph, tree, planar graph, hamiltonian cycle, cograph, acyclic, series-parallel graph, girth |
27 | Dewan F. Wahid, Elkafi Hassini |
User-generated short-text classification using cograph editing-based network clustering with an application in invoice categorization. |
Data Knowl. Eng. |
2023 |
DBLP DOI BibTeX RDF |
|
27 | Christophe Crespelle, Rémi Pellerin, Stéphan Thomassé |
A quasi-quadratic vertex Kernel for Cograph edge editing. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
27 | Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry |
Faster and enhanced inclusion-minimal cograph completion. |
Discret. Appl. Math. |
2021 |
DBLP DOI BibTeX RDF |
|
27 | Christophe Crespelle |
Linear-Time Minimal Cograph Editing. |
FCT |
2021 |
DBLP DOI BibTeX RDF |
|
27 | Dekel Tsur |
Faster algorithms for cograph edge modification problems. |
Inf. Process. Lett. |
2020 |
DBLP DOI BibTeX RDF |
|
27 | Adrian Fritz, Marc Hellmuth, Peter F. Stadler, Nicolas Wieseke |
Cograph editing: Merging modules is equivalent to editing P_4s. |
Art Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
27 | Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry |
Faster and Enhanced Inclusion-Minimal Cograph Completion. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
27 | Juli Zhang, Zhanzhuang He, Junyi Zhang, Tao Dai 0002 |
Cograph Regularized Collective Nonnegative Matrix Factorization for Multilabel Image Annotation. |
IEEE Access |
2019 |
DBLP DOI BibTeX RDF |
|
27 | Dekel Tsur |
Faster algorithms for cograph edge modification problems. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
27 | Jie Mei, Liqiang Zhang 0001, Yuebin Wang, Zidong Zhu, Huiqian Ding |
Joint Margin, Cograph, and Label Constraints for Semisupervised Scene Parsing From Point Clouds. |
IEEE Trans. Geosci. Remote. Sens. |
2018 |
DBLP DOI BibTeX RDF |
|
27 | Átila A. Jones, Fábio Protti, Renata R. Del-Vecchio |
Cograph generation with linear delay. |
Theor. Comput. Sci. |
2018 |
DBLP DOI BibTeX RDF |
|
27 | Marc Hellmuth, Nicolas Wieseke |
On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions. |
J. Comb. Optim. |
2018 |
DBLP DOI BibTeX RDF |
|
27 | W. Timothy J. White, Marcus Ludwig, Sebastian Böcker |
Cograph Editing in O(3nn) time and O(2n) space. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
27 | Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry |
Faster and Enhanced Inclusion-Minimal Cograph Completion. |
COCOA (1) |
2017 |
DBLP DOI BibTeX RDF |
|
27 | Átila A. Jones, Fábio Protti, Renata R. Del-Vecchio |
Cograph generation with linear delay. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
27 | Marc Hellmuth, Nicolas Wieseke |
On Tree Representations of Relations and Graphs: Symbolic Ultrametrics and Cograph Edge Decompositions. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
27 | Marc Hellmuth, Adrian Fritz, Nicolas Wieseke, Peter F. Stadler |
Techniques for the Cograph Editing Problem: Module Merge is equivalent to Editing P4s. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
27 | Marc Hellmuth, Nicolas Wieseke |
On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
27 | Marc Hellmuth, Nicolas Wieseke |
On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions. |
COCOON |
2015 |
DBLP DOI BibTeX RDF |
|
27 | Yunlong Liu 0001, Jianxin Wang 0001, Jiong Guo, Jianer Chen |
Complexity and parameterized algorithms for Cograph Editing. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
27 | James Nastos, Yong Gao 0001 |
Bounded Search Tree Algorithms for Parametrized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes. |
Discret. Math. Algorithms Appl. |
2012 |
DBLP DOI BibTeX RDF |
|
27 | Yuta Yoshimura, Takayoshi Shoudai, Yusuke Suzuki, Tomoyuki Uchida, Tetsuhiro Miyahara |
Polynomial Time Inductive Inference of Cograph Pattern Languages from Positive Data. |
ILP |
2011 |
DBLP DOI BibTeX RDF |
|
27 | Yunlong Liu 0001, Jianxin Wang 0001, Jiong Guo, Jianer Chen |
Cograph Editing: Complexity and Parameterized Algorithms. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
27 | James Nastos, Yong Gao 0001 |
Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes |
CoRR |
2010 |
DBLP BibTeX RDF |
|
27 | Daniel Lokshtanov, Federico Mancini 0001, Charis Papadopoulos |
Characterizing and computing minimal cograph completions. |
Discret. Appl. Math. |
2010 |
DBLP DOI BibTeX RDF |
|
27 | Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul |
A Simple Linear Time LexBFS Cograph Recognition Algorithm. |
SIAM J. Discret. Math. |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Türker Bíyíkoglu |
Degree Sequences of Halin Graphs, and Forcibly Cograph-graphic Sequences. |
Ars Comb. |
2005 |
DBLP BibTeX RDF |
|
27 | Michel Habib, Christophe Paul |
A simple linear time algorithm for cograph recognition. |
Discret. Appl. Math. |
2005 |
DBLP DOI BibTeX RDF |
|
27 | Sulamita Klein, Noemi C. dos Santos, Jayme Luiz Szwarcfiter |
A representation for the modular-pairs of a cograph by modular decomposition. |
Electron. Notes Discret. Math. |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Volker Diekert, Paul Gastin |
Local temporal logic is expressively complete for cograph dependence alphabets. |
Inf. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Igor E. Zverovich, Inessa I. Zverovich |
Forbidden induced subgraph characterization of cograph contractions. |
J. Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Gordon F. Royle |
The Rank of a Cograph. |
Electron. J. Comb. |
2003 |
DBLP DOI BibTeX RDF |
|
27 | Van Bang Le |
A good characterization of cograph contractions. |
J. Graph Theory |
1999 |
DBLP DOI BibTeX RDF |
|
27 | Michael Bertol |
Efficient Rewriting in Cograph Trace Monoids. |
FCT |
1995 |
DBLP DOI BibTeX RDF |
|
27 | Xin He |
Parallel Algorithm for Cograph Recognition with Applications. |
J. Algorithms |
1993 |
DBLP DOI BibTeX RDF |
|
27 | Xin He |
Parallel Algorithm for Cograph Recognition with Applications. |
SWAT |
1992 |
DBLP DOI BibTeX RDF |
|
21 | Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng |
Roman Domination over Some Graph Classes. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Vadim V. Lozin |
On a Generalization of Bi-Complement Reducible Graphs. |
MFCS |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Koji Nakano, Stephan Olariu, Albert Y. Zomaya |
A Time-Optimal Solution for the Path Cover Problem on Cographs. |
IPPS/SPDP |
1999 |
DBLP DOI BibTeX RDF |
|
21 | Alain Cournier, Michel Habib |
A New Linear Algorithm for Modular Decomposition. |
CAAP |
1994 |
DBLP DOI BibTeX RDF |
autonomous subsets, clans, graph decomposition trees, vertex-splitting. cotrees, Graphs, modules, substitution, cographs, prime graphs |
Displaying result #1 - #55 of 55 (100 per page; Change: )
|
|