On the Largest Graph-Lagrangian of 3-Graphs with Fixed Number of Edges.
Yanping SunQingsong TangCheng ZhaoYuejian PengPublished in: J. Optim. Theory Appl. (2014)
Keyphrases
- fixed number
- directed graph
- weighted graph
- undirected graph
- real world graphs
- spanning tree
- edge weights
- massive graphs
- graph structure
- spectral embedding
- adjacency matrix
- graph mining
- graph representation
- graph model
- graph partitioning
- graph clustering
- random walk
- graph matching
- labeled graphs
- connected components
- nodes of a graph
- graph theory
- directed edges
- graph structures
- bipartite graph
- graph properties
- vertex set
- graph classification
- random graphs
- graph databases
- graph theoretical
- graph construction
- minimum spanning tree
- densely connected
- finite number
- subgraph isomorphism
- graph search
- graph theoretic
- directed acyclic graph
- social networks
- community detection
- dynamic graph
- graph isomorphism
- strongly connected
- directed acyclic
- graph patterns
- graph data
- reachability queries
- dense subgraphs
- connected graphs
- maximum common subgraph
- graph representations
- attributed graphs
- series parallel
- graph kernels
- shortest path
- adjacency graph
- planar graphs
- graph layout
- finding the shortest path
- complex networks
- identical parallel machines
- neighborhood graph
- maximum cardinality
- approximation algorithms