Buscar
Mostrando ítems 1-10 de 339
A pair of forbidden subgraphs and perfect matchings
(Academic Press Inc Elsevier ScienceSan DiegoEUA, 2006)
Graphs with independent perfect matchings
(John Wiley & Sons IncHobokenEUA, 2005)
The perfect matching polytope and solid bricks
(Academic Press Inc Elsevier ScienceSan DiegoEUA, 2004)
Clique-perfectness of complements of line graphs
(Elsevier, 2015)
A graph is clique-perfect if the maximum number of pairwise disjoint maximal cliques
equals the minimum number of vertices intersecting all maximal cliques for each induced
subgraph. In this work, we give necessary and ...
Clique-perfectness of complements of line graphs
(Elsevier Science, 2015-05)
A graph is clique-perfect if the maximum number of pairwise disjoint maximal cliques equals the minimum number of vertices intersecting all maximal cliques for each induced subgraph. In this work, we give necessary and ...
Matching signatures and Pfaffian graphs
(Elsevier Science BvAmsterdamHolanda, 2011)
Perfectly matched layers.
(Marburg, S.Nolte, B.Springer, Berlin, Heidelberg, 2008)
This is a survey of some recent developments on the so called “Perfectly Matched Layer” (PML) method. We take as model the scattering problems in linear acoustics. First, the Cartesian PML equations are described in the ...
How to build a brick
(Elsevier Science BvAmsterdamHolanda, 2006)
Novel boundary condition for the finite-element solution of arbitrary planar junctions
(Ieee-inst Electrical Electronics Engineers IncNew YorkEUA, 2001)
Pade boundary conditions for the finite-element modeling of arbitrary planar junctions
(Ieee-inst Electrical Electronics Engineers IncPiscatawayEUA, 2004)