On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (Q2268880)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs |
scientific article; zbMATH DE number 5678880
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs |
scientific article; zbMATH DE number 5678880 |
Statements
On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (English)
0 references
9 March 2010
0 references
chordless paths
0 references
bipartite graphs
0 references
interval operators
0 references
graph convexity
0 references
simple paths
0 references
even-chorded paths
0 references
0.89806926
0 references
0.89253235
0 references
0 references
0.8859135
0 references
0.8851396
0 references
0.8845162
0 references
0.8841343
0 references
0.87798524
0 references
