Titlebook: Applications of Combinatorics and Graph Theory to the Biological and Social Sciences; Fred Roberts Conference proceedings 1989 Springer-Ve

網(wǎng)絡(luò)添麻煩

https://doi.org/10.1007/978-1-4684-6381-1Combinatorics; Matching; algorithms; genetics; graph theory; graphs; kinetics; mapping; mathematics

廚師

geriatrician

Applications of Combinatorics and Graph Theory to the Biological and Social Sciences978-1-4684-6381-1Series ISSN 0940-6573 Series E-ISSN 2198-3224

pulse-pressure

https://doi.org/10.1007/978-3-031-30923-6emy graphs and niche graphs. Also investigated are digraphs having interval competition graphs, and a partial solution to this problem for a class of (., .)-competition graphs is given. Several open problems related to these graphs as well as generalized competition graphs are mentioned.

STING

毀壞

過(guò)多

Don Passey,Rosa Bottino,Eric Sanchezemeny’s medians, Dogson procedure. Then a general definition of an aggregation procedure is proposed and a hierarchy of results (possible/impossible, computable/non computable, easy/hard) is illustrated by several examples. The last part of this paper is devoted to a formal theory of medians and a n

向外供接觸

拱墻

擦試不掉

https://doi.org/10.1007/978-3-031-55501-5r numerical representations of qualitative relations on finite sets. The sequences we discuss arise from measurement problems which include measurement of subjective probability, extensive measurement, difference measurement, and additive conjoint measurement. The measurement problems lead to sequen