Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Graph_bandwidth> ?p ?o. }
Showing items 1 to 42 of
42
with 100 items per page.
- Graph_bandwidth abstract "In graph theory, the graph bandwidth problem is to label the n vertices vi of a graph G with distinct integers f(vi) so that the quantity is minimized (E is the edge set of G).The problem may be visualized as placing the vertices of a graph at distinct integer points along the x-axis so that the length of the longest edge is minimized. Such placement is called linear graph arrangement, linear graph layout or linear graph placement.The weighted graph bandwidth problem is a generalization wherein the edges are assigned weights wij and the cost function to be minimized is .In terms of matrices, the (unweighted) graph bandwidth is the bandwidth of the symmetric matrix which is the adjacency matrix of the graph.The bandwidth may also be defined as one less than the maximum clique size in a proper interval supergraph of the given graph, chosen to minimize its clique size (Kaplan & Shamir 1996).".
- Graph_bandwidth wikiPageExternalLink node53.html.
- Graph_bandwidth wikiPageExternalLink 86log.PDF.
- Graph_bandwidth wikiPageID "27414778".
- Graph_bandwidth wikiPageRevisionID "604958275".
- Graph_bandwidth hasPhotoCollection Graph_bandwidth.
- Graph_bandwidth subject Category:Combinatorial_optimization.
- Graph_bandwidth subject Category:Graph_algorithms.
- Graph_bandwidth subject Category:Graph_invariants.
- Graph_bandwidth subject Category:NP-hard_problems.
- Graph_bandwidth type Abstraction100002137.
- Graph_bandwidth type Act100030358.
- Graph_bandwidth type Activity100407535.
- Graph_bandwidth type Algorithm105847438.
- Graph_bandwidth type Attribute100024264.
- Graph_bandwidth type Cognition100023271.
- Graph_bandwidth type Concept105835747.
- Graph_bandwidth type Condition113920835.
- Graph_bandwidth type Content105809192.
- Graph_bandwidth type Difficulty114408086.
- Graph_bandwidth type Event100029378.
- Graph_bandwidth type Feature105849789.
- Graph_bandwidth type GraphAlgorithms.
- Graph_bandwidth type GraphInvariants.
- Graph_bandwidth type Idea105833840.
- Graph_bandwidth type Invariant105850432.
- Graph_bandwidth type NP-hardProblems.
- Graph_bandwidth type Problem114410605.
- Graph_bandwidth type Procedure101023820.
- Graph_bandwidth type Property105849040.
- Graph_bandwidth type PsychologicalFeature100023100.
- Graph_bandwidth type Rule105846932.
- Graph_bandwidth type State100024720.
- Graph_bandwidth type YagoPermanentlyLocatedEntity.
- Graph_bandwidth comment "In graph theory, the graph bandwidth problem is to label the n vertices vi of a graph G with distinct integers f(vi) so that the quantity is minimized (E is the edge set of G).The problem may be visualized as placing the vertices of a graph at distinct integer points along the x-axis so that the length of the longest edge is minimized.".
- Graph_bandwidth label "Graph bandwidth".
- Graph_bandwidth sameAs m.0c00126.
- Graph_bandwidth sameAs Q5597073.
- Graph_bandwidth sameAs Q5597073.
- Graph_bandwidth sameAs Graph_bandwidth.
- Graph_bandwidth wasDerivedFrom Graph_bandwidth?oldid=604958275.
- Graph_bandwidth isPrimaryTopicOf Graph_bandwidth.