Results 111 to 120 of about 4,514 (260)

Characterization of Circular-arc Graphs: III. Chordal Graphs

open access: yesCoRR
We identify all minimal chordal graphs that are not circular-arc graphs, thereby resolving one of ``the main open problems'' concerning the structures of circular-arc graphs as posed by Dur{á}n, Grippo, and Safe in 2011. The problem had been attempted even earlier, and previous efforts have yielded partial results, particularly for claw-free graphs and
Yixin Cao 0001, Tomasz Krawczyk
openaire   +2 more sources

Efficient Enumeration of Maximal and Maximum Independent Sets of an Interval Graph and a Circular-Arc Graph.

open access: yes, 1987
We present efficient algorithms for generating all maximal and all maximum independent sets of an interval graph and a circular- arc graph. When an interval graph is given in the form of a family of n intervals, the first and second algorithms produce ...
Kashiwabara, Toshinobu   +3 more
core  

‘Free to Be Me?’: Gender Role Norms Constrain Career Interests Less for Lesbian, Gay and Bisexual People Than for Heterosexual People

open access: yesEuropean Journal of Social Psychology, EarlyView.
ABSTRACT Societal gender role norms play a crucial role in shaping men's and women's career aspirations. However, prior research documenting this key role of gendered norms has primarily focused on heterosexual women and men in the global North‐West. Previous studies documenting differences in career interests by sexual orientation suggest that gender ...
Katharina Block   +136 more
wiley   +1 more source

Stereo‐EEG mapping of visual working memory with task‐related high‐gamma modulations

open access: yesEpilepsia, EarlyView.
Abstract Objective We describe a safe, informative, and easy‐to‐implement approach for presurgical mapping of visual working memory (VWM) with stereo‐electroencephalography (SEEG). Methods Twenty‐four patients with drug‐resistant epilepsy, 11–23 years of age, performed a single‐probe change detection VWM task, during SEEG monitoring.
Brian Ervin   +13 more
wiley   +1 more source

Acceleration of Singlet Oxygen Evolution by Sonopiezoelectric Charge Transfer Over SrTiO3‐TiO2 Heterojunction for Selective Oxidation

open access: yesExploration, EarlyView.
A sonopiezo‐triggered singlet oxygen evolution system by S‐scheme SrTiO3‐TiO2 heterojunction was rationally designed to selectively remove electron‐rich pollutants from water. ABSTRACT Sonopiezo‐mediated heterogeneous catalysis is a promising technology for efficient removal of organic pollutants from wastewater. Nevertheless, it is challenging in real
Weiwei Wang   +7 more
wiley   +1 more source

Intraday Functional PCA Forecasting of Cryptocurrency Returns

open access: yesJournal of Forecasting, EarlyView.
ABSTRACT We study the functional PCA (FPCA) forecasting method in application to functions of intraday returns on Bitcoin. We show that improved interval forecasts of future return functions are obtained when the conditional heteroscedasticity of return functions is taken into account.
Joann Jasiak, Cheng Zhong
wiley   +1 more source

Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes

open access: yes, 2005
The Maximum Independent Set problem in d-box graphs, i.e., in the intersection graphs of axis-parallel rectangles in R d , is a challenge open problem. For any fixed d ≥ 2 the problem is NP-hard and no approximation algorithm with ratio o(log d−1 n) is ...
Chlebikova, Janka   +5 more
core  

Notable Impact of Paleotectonic Stress on Gold Mineralisation in the West Qinling Orogen

open access: yesGeological Journal, EarlyView.
By applying fuzzy clustering and multiple inverse methods, we systematically processed the data of vein and fault slip in this ore deposit to reveal the transition of orogenic geological environment and paleotectonic stress field. Our research results show two different stress states: the northwest–southeast extensional stress field and the northeast ...
Hongyan Wang   +3 more
wiley   +1 more source

Generation of Maximum Independent Sets of a Biparite Graph and Maximum Cliques of a Circular-Arc Graph.

open access: yes, 1989
We present an efflcient algorithm for generating all maximum independent sets of a bipartite graph. Its time complexity is O (n sup 2.5 + (output size )), where n is the number of vertices of a given graph. As its application, we develop an algorithm for
Kashiwabara, Toshinobu   +3 more
core  

A Sequential Algorithm to Solve Next-to-Shortest Path Problem on Circular-arc Graphs [PDF]

open access: yes, 2006
201-217In this article, we study the problem of finding the next-to-shortest path in circular-arc graph. A next-to-shortest path between any pair of vertices in a shortest path amongst all paths between those vertices with length strictly greater than ...
Mandal, Swagata, Pal, Madhumangal
core  

Home - About - Disclaimer - Privacy