Graph Algorithms and Applications

• Muut tekijät: Stefano, Gabriele Di (Toimittaja), Cicerone, Serafino (Toimittaja)
• Aineistotyyppi: Elektroninen Kirjan osa
• Kieli: englanti
• Julkaistu: Basel MDPI - Multidisciplinary Digital Publishing Institute 2022
• Aiheet: Information technology industries; Computer science; planar graphs; k-planarity; NP-hardness; polynomial time reduction; cliques; paths; computational social choice; election control; multi-winner election; social influence; influence maximization; congestion games; pure Nash equilibrium; potential games; price of anarchy; price of stability; phylogenetic tree; evolutionary tree; ancestral mixture model; mixture tree; mixture distance; tree comparison; clique independent set; clique transversal number; signed clique transversal function; minus clique transversal function; k-fold clique transversal set; distance-hereditary graphs; stretch number; recognition problem; forbidden subgraphs; hole detection; analysis and design or graph algorithms; distributed graph and network algorithms; graph theory with algorithmic applications; computational complexity of graph problems; experimental evaluation of graph algorithms
• Linkit: DOAB: download the publication; DOAB: description of the publication

The mixture of data in real-life exhibits structure or connection property in nature. Typical data include biological data, communication network data, image data, etc. Graphs provide a natural way to represent and analyze these types of data and their relationships. Unfortunately, the related algor...