Rotation map (original) (raw)
In mathematics, a rotation map is a function that represents an undirected edge-labeled graph, where each vertex enumerates its outgoing neighbors. Rotation maps were first introduced by Reingold, Vadhan and Wigderson (“Entropy waves, the zig-zag graph product, and new constant-degree expanders”, 2002) in order to conveniently define the zig-zag product and prove its properties.Given a vertex and an edge label , the rotation map returns the 'th neighbor of and the edge label that would lead back to .
Property | Value |
---|---|
dbo:abstract | In mathematics, a rotation map is a function that represents an undirected edge-labeled graph, where each vertex enumerates its outgoing neighbors. Rotation maps were first introduced by Reingold, Vadhan and Wigderson (“Entropy waves, the zig-zag graph product, and new constant-degree expanders”, 2002) in order to conveniently define the zig-zag product and prove its properties.Given a vertex and an edge label , the rotation map returns the 'th neighbor of and the edge label that would lead back to . (en) |
dbo:wikiPageID | 28396062 (xsd:integer) |
dbo:wikiPageLength | 3202 (xsd:nonNegativeInteger) |
dbo:wikiPageRevisionID | 1100495473 (xsd:integer) |
dbo:wikiPageWikiLink | dbc:Extensions_and_generalizations_of_graphs dbr:Mathematics dbr:Rotation_system dbr:Zig-zag_product dbr:Journal_of_the_ACM dbr:Involution_(mathematics) dbc:Graph_operations dbr:Labeled_graph |
dbp:wikiPageUsesTemplate | dbt:Citation dbt:Distinguish dbt:Refbegin dbt:Refend |
dct:subject | dbc:Extensions_and_generalizations_of_graphs dbc:Graph_operations |
rdf:type | owl:Thing yago:Abstraction100002137 yago:Action114006945 yago:Attribute100024264 yago:Delay115272029 yago:Extension115272382 yago:Measure100033615 yago:Operation114008806 yago:Pause115271008 yago:WikicatGraphOperations yago:State100024720 yago:TimeInterval115269513 yago:WikicatExtensionsAndGeneralizationsOfGraphs |
rdfs:comment | In mathematics, a rotation map is a function that represents an undirected edge-labeled graph, where each vertex enumerates its outgoing neighbors. Rotation maps were first introduced by Reingold, Vadhan and Wigderson (“Entropy waves, the zig-zag graph product, and new constant-degree expanders”, 2002) in order to conveniently define the zig-zag product and prove its properties.Given a vertex and an edge label , the rotation map returns the 'th neighbor of and the edge label that would lead back to . (en) |
rdfs:label | Rotation map (en) |
owl:differentFrom | dbr:Rotation_(mathematics) |
owl:sameAs | freebase:Rotation map wikidata:Rotation map https://global.dbpedia.org/id/4umn5 yago-res:Rotation map |
prov:wasDerivedFrom | wikipedia-en:Rotation_map?oldid=1100495473&ns=0 |
foaf:isPrimaryTopicOf | wikipedia-en:Rotation_map |
is dbo:wikiPageWikiLink of | dbr:Rotation_system dbr:Zig-zag_product |
is foaf:primaryTopic of | wikipedia-en:Rotation_map |