Three-fast-searchable graphs (Q2446838): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2013.03.004
@@ Property / DOI: 10.1016/j.dam.2013.03.004 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2013.03.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2132813033
@@ Property / OpenAlex ID: W2132813033 / rank @@
+Normal rank
@@ Property / cites work @@
+Cleaning Regular Graphs with Brushes
@@ Property / cites work: Cleaning Regular Graphs with Brushes / rank @@
+Normal rank
@@ Property / cites work @@
+Time constrained graph searching
@@ Property / cites work: Time constrained graph searching / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced vertex-orderings of graphs
@@ Property / cites work: Balanced vertex-orderings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Monotonicity in graph searching
@@ Property / cites work: Monotonicity in graph searching / rank @@
+Normal rank
@@ Property / cites work @@
+On the Fast Searching Problem
@@ Property / cites work: On the Fast Searching Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The vertex separation and search number of a graph
+Normal rank
@@ Property / cites work @@
+An annotated bibliography on guaranteed graph searching
+Normal rank
@@ Property / cites work @@
+On the pathwidth of chordal graphs
@@ Property / cites work: On the pathwidth of chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The vertex separation number of a graph equals its path-width
+Normal rank
@@ Property / cites work @@
+Searching and pebbling
@@ Property / cites work: Searching and pebbling / rank @@
+Normal rank
@@ Property / cites work @@
+Recontamination does not help to search a graph
@@ Property / cites work: Recontamination does not help to search a graph / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of searching a graph
@@ Property / cites work: The complexity of searching a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4159394
@@ Property / cites work: Q4159394 / rank @@
+Normal rank
@@ Property / cites work @@
+Searching Trees with Sources and Targets
@@ Property / cites work: Searching Trees with Sources and Targets / rank @@
+Normal rank
@@ Property / cites work @@
+Fast edge searching and fast searching on graphs
@@ Property / cites work: Fast edge searching and fast searching on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Sweeping graphs with large clique number
@@ Property / cites work: Sweeping graphs with large clique number / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2013.03.004
@@ Property / DOI: 10.1016/J.DAM.2013.03.004 / rank @@
+Normal rank