×

Found 131 Documents (Results 1–100)

Perturbation of threshold of the essential spectrum of the Schrödinger operator on the simplest graph with a small edge. (English. Russian original) Zbl 1426.34039

J. Math. Sci., New York 239, No. 3, 248-267 (2019); translation from Probl. Mat. Anal. 97, 15-30 (2019).
PDFBibTeX XMLCite
Full Text: DOI

Translating essential OCL invariants to nested graph constraints focusing on set operations. (English) Zbl 1321.68203

Parisi-Presicce, Francesco (ed.) et al., Graph transformation. 8th international conference, ICGT 2015, held as part of STAF 2015, L’Aquila, Italy, July 21–23, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-21144-2/pbk; 978-3-319-21145-9/ebook). Lecture Notes in Computer Science 9151, 155-170 (2015).
PDFBibTeX XMLCite
Full Text: DOI

On irreducibility of maximal cliques. (English) Zbl 1235.05109

Miller, Mirka (ed.) et al., Proceedings of the 19th international workshop on combinatorial algorithms, IWOCA 2008, Nagoya, Japan, September 12–15, 2008. London: College Publications (ISBN 978-1-904987-74-1/pbk). Texts in Algorithmics 12, 63-74 (2009).
PDFBibTeX XMLCite

Some problems related to Hamiltonian line graphs. (English) Zbl 1408.05079

Chen, Zhijie (ed.) et al., Proceedings of the international conference on complex geometry and related fields, Shanghai, China, 2004. Providence, RI: American Mathematical Society (AMS); Somerville, MA: International Press. AMS/IP Stud. Adv. Math. 39, 149-159 (2007).
MSC:  05C45 05C38 05C76
PDFBibTeX XMLCite

Every 3-connected, essentially 11-connected line graph is Hamiltonian. (English) Zbl 1192.05129

Felsner, Stefan (ed.), 2005 European conference on combinatorics, graph theory and applications (EuroComb ’05). Extended abstracts from the conference, Technische Universität Berlin, Berlin, Germany, September 5–9, 2005. Paris: Maison de l’Informatique et des Mathématiques Discrètes (MIMD). Discrete Mathematics & Theoretical Computer Science. Proceedings. AE, 379-382, electronic only (2005).
MSC:  05C76 05C45
PDFBibTeX XMLCite
Full Text: Link

Learning causal structures based on Markov equivalence class. (English) Zbl 1168.68466

Jain, Sanjay (ed.) et al., Algorithmic learning theory. 16th international conference, ALT 2005, Singapore, October 8–11, 2005. Proceedings. Berlin: Springer (ISBN 3-540-29242-X/pbk). Lecture Notes in Computer Science 3734. Lecture Notes in Artificial Intelligence, 92-106 (2005).
MSC:  68T05 60C05 68T30
PDFBibTeX XMLCite
Full Text: DOI

Knots with only two strict essential surfaces. (English) Zbl 1083.57005

Gordon, Cameron (ed.) et al., Proceedings of the Casson Fest. Based on the 28th University of Arkansas spring lecture series in the mathematical sciences, Fayetteville, AR, USA, April 10–12, 2003 and the conference on the topology of manifolds of dimensions 3 and 4, Austin, TX, USA, May 19–21, 2003. Coventry: Geometry and Topology Publications. Geometry and Topology Monographs 7, 335-430 (2004).
MSC:  57M25 57M15 57M50
PDFBibTeX XMLCite
Full Text: arXiv EMIS

Graphical model search via essential graphs. (English) Zbl 1018.05098

Viana, Marlos A. G. (ed.) et al., Algebraic methods in statistics and probability. AMS special session on algebraic methods in statistics, Univ. of Notre Dame, IN, USA, April 8-9, 2000. Providence, RI: AMS, American Mathematical Society. Contemp. Math. 287, 255-265 (2001).
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software