Results 121 to 130 of about 2,481 (263)
Establishing Shape Correspondences: A Survey
Computer Graphics Forum, EarlyView.Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley +1 more source
A New Characterization of Unichord-Free Graphs
Discussiones Mathematicae Graph Theory, 2015 Unichord-free graphs are defined as having no cycle with a unique chord. They have appeared in several papers recently and are also characterized by minimal separators always inducing edgeless subgraphs (in contrast to characterizing chordal graphs by ...
McKee Terry A.
doaj +1 more source
CLusterix: A Hybrid Visualization Model for Hierarchically Clustered Networks
Computer Graphics Forum, EarlyView.Abstract We introduce Clusterix, a novel hybrid visualization model for representing hierarchically clustered networks, which also supports directed and weighted edges. Clusterix offers an integrated view of both the network and its full cluster hierarchy by compactly visualizing the cluster inclusion tree enriched with links of the network.
Carla Binucci +6 more
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2019 Several recent papers have investigated unichord-free graphs—the graphs in which no cycle has a unique chord. This paper proposes a concept of strongly unichord-free graph, defined by being unichord-free with no cycle of length 5 or more having exactly ...
McKee Terry A.
doaj +1 more source
The 0-1 inverse maximum stable set problem [PDF]
Given an instance of a weighted combinatorial optimization problem and its feasible solution, the usual inverse problem is to modify as little as possible (with respect to a fixed norm) the given weight system to make the giiven feasible solution optimal.
Yerim Chung, Marc Demange
core
Survey on Visualization of Information Diffusion over Networks
Computer Graphics Forum, EarlyView.Abstract Information Diffusion (ID) describes how a value (e.g., a pathogen, a rumor, a packet) spreads through an underlying “medium” network of elements (e.g., a social or computer network). Understanding the information diffusion process is essential to predicting trends, controlling misinformation, and enhancing decision‐making as well as ...
T. Baumgartl +8 more
wiley +1 more source
Graph Isomorphism Completeness for Chordal bipartite graphs and Strongly Chordal Graphs
, 2004 This paper deals with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chordal graphs. It is known that GI problem is GI complete even for some special graph classes including regular graphs, bipartite ...
Ryuhei Uehara, et al.
core
Single‐Cell Virtual Perturbation Screening Identifies STAT3 as a Key Regulator of Dentinogenesis
Cell Proliferation, EarlyView.STAT3 promotes odontoblast differentiation in dental mesenchymal cells by transcriptionally regulating WNT2B via the canonical Wnt/β‐catenin signalling pathway. These findings elucidate a mechanism underlying dentine development. ABSTRACT Dentine formation constitutes a physiological process precisely regulated by signal transduction modules governing ...
Yanfei Zhu +12 more
wiley +1 more source
How Is a Chordal Graph Like a Supersolvable Binary Matroid?
, 2007 Let G be a finite simple graph. From the pioneering work of R. P. Stanley it is known that the cycle matroid of G is supersolvable i# G is chordal (rigid): this is an other way to read Dirac's theorem on chordal graphs.
Sulamita Klein +2 more
core
On the correspondence between tree representations of chordal and dually chordal graphs [PDF]
, 2019 Chordal graphs and their clique graphs (called dually chordal graphs) possess characteristic tree representations, namely, the clique tree and the compatible tree, respectively.
De Caria, Pablo Jesús +1 more
core