Showing 1 - 10 of 6,976
The three-in-a-tree algorithm of Chudnovsky and Seymour decides in time O(n4) whether three given vertices of a graph … provide an O(nm)-time algorithm that given a triangle-free graph G together with four vertices outputs either an induced tree … belong to an induced tree. Here, we study four-in-a-tree for triangle-free graphs. We give a structural answer to the …
Persistent link: https://www.econbiz.de/10005696778
Persistent link: https://www.econbiz.de/10011538965
Persistent link: https://www.econbiz.de/10012113659
Persistent link: https://www.econbiz.de/10012116611
Persistent link: https://www.econbiz.de/10014313910
smoothcompactly supported solutions of this equation and the convergence ofthe corresponding cascade algorithm/subdivision scheme. We …
Persistent link: https://www.econbiz.de/10010325019
This paper presents results on the transitivity of the majority relation and the existence of a median representative ordering. Building on the notion of intermediate preferences indexed by a median graph, the analysis extends well-known results obtained when the underlying graph is a line. In...
Persistent link: https://www.econbiz.de/10010317116
Persistent link: https://www.econbiz.de/10000826868
Persistent link: https://www.econbiz.de/10003727858