Maximizing the strong triadic closure in split graphs and proper interval graphs
DOI10.4230/LIPICS.ISAAC.2017.53zbMATH Open1457.05098MaRDI QIDQ5136273FDOQ5136273
Authors: Athanasios L. Konstantinidis, Charis Papadopoulos 
Publication date: 25 November 2020
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Social networks; opinion dynamics (91D30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Networks, crowds and markets. Reasoning about a highly connected world.
- Reducibility among combinatorial problems
- Social and economic networks.
- Graph Classes: A Survey
- Paths, Trees, and Flowers
- Complement reducible graphs
- Optimal greedy algorithms for indifference graphs
- Computing square roots of trivially perfect and threshold graphs
- Parameterized algorithms for finding square roots
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Bipartite roots of graphs
- Title not available (Why is that?)
- Recognizing Powers of Proper Interval, Split, and Chordal Graphs
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Title not available (Why is that?)
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Trivially perfect graphs
- The clique-separator graph for chordal graphs
- Computing the Bandwidth of Interval Graphs
- Gallai graphs and anti-Gallai graphs
- Generalized graph clustering: recognizing \((p,q)\)-cluster graphs
- Complexity of the cluster deletion problem on subclasses of chordal graphs
- Tree decompositions and social graphs
Cited In (6)
- Strong triadic closure in cographs and graphs of low maximum degree
- Relaxing the strong triadic closure problem for edge strength inference
- Strong triadic closure in cographs and graphs of low maximum degree
- Parameterized aspects of strong subgraph closure
- Maximizing the strong triadic closure in split graphs and proper interval graphs
- Parameterized aspects of strong subgraph closure
This page was built for publication: Maximizing the strong triadic closure in split graphs and proper interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136273)
