Using shortcut edges to maximize the number of triangles in graphs (Q1785441): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: KronFit / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2015.09.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1644104870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random graph model for massive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting high log-densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximability and non-approximability results for graph diameter decreasing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Diameter of a Network Using Shortcut Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Eulerian Extension and Rural Postman / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Eulerian extensions and their application to no-wait flowshop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Average Shortest Path Distances via Shortcut Edge Addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5198578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CHANGING OPINIONS IN A CHANGING WORLD: A NEW PERSPECTIVE IN SOCIOPHYSICS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing the robustness of scale-free networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:49, 16 July 2024

scientific article
Language Label Description Also known as
English
Using shortcut edges to maximize the number of triangles in graphs
scientific article

    Statements

    Using shortcut edges to maximize the number of triangles in graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 September 2018
    0 references
    triangles
    0 references
    graphs
    0 references
    NP-complete
    0 references
    approximation algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references