scientific article; zbMATH DE number 7278058
From MaRDI portal
Publication:5136273
DOI10.4230/LIPIcs.ISAAC.2017.53zbMath1457.05098MaRDI QIDQ5136273
Charis Papadopoulos, Athanasios L. Konstantinidis
Publication date: 25 November 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Social networks; opinion dynamics (91D30) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (4)
Parameterized aspects of strong subgraph closure ⋮ On the relation of strong triadic closure and cluster deletion ⋮ Strong triadic closure in cographs and graphs of low maximum degree ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parameterized algorithms for finding square roots
- Complexity of the cluster deletion problem on subclasses of chordal graphs
- Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs
- The clique-separator graph for chordal graphs
- Gallai graphs and anti-Gallai graphs
- Complement reducible graphs
- Trivially perfect graphs
- Optimal greedy algorithms for indifference graphs
- Computing square roots of trivially perfect and threshold graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Bipartite roots of graphs
- Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs
- Computing the Bandwidth of Interval Graphs
- Graph Classes: A Survey
- Recognizing Powers of Proper Interval, Split, and Chordal Graphs
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Reducibility among Combinatorial Problems
- Paths, Trees, and Flowers
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Tree decompositions and social graphs
This page was built for publication:
