Fast Searching on Cartesian Products of Graphs

DOI10.1007/978-3-319-55911-7_48zbMath1462.05315OpenAlexW2598880527MaRDI QIDQ2988858

Yuan Xue, Boting Yang

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-55911-7_48

zbMATH Keywords

Cartesian product of an Eulerian graph and a pathfast searching problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Fast Searching on Complete k-partite Graphs

Cites Work

• Fast searching games on graphs
• Fast edge searching and fast searching on graphs
• The treewidth and pathwidth of hypercubes
• An annotated bibliography on guaranteed graph searching
• Searching and pebbling
• Three-fast-searchable graphs
• On the Fast Searching Problem
• Topological Bandwidth
• The complexity of searching a graph
• Monotonicity in graph searching
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast Searching on Cartesian Products of Graphs